#include <iostream>
#include <stdio.h>
using namespace std;

int gr[2001][2001];
int n;
int SumUp[2001][2001];
int SumDown[2001][2001];
int SumLeft[2001][2001];
int SumRight[2001][2001];

bool Okay(int sz,int x,int y)
{
    int sum=SumUp[x][y+sz-1]-SumUp[x][y-1];
    sum+=SumDown[x+sz-1][y+sz-1]-SumDown[x+sz-1][y-1];
    sum+=SumLeft[x+sz-1][y]-SumLeft[x-1][y];
    sum+=SumRight[x+sz-1][y+sz-1]-SumRight[x-1][y+sz-1];
    
    return sum==0;
}

int X,Y;
bool Try(int sz)
{
    int i,j;
    
    for (i=2;i<=n-1;i++)
    {
        for (j=2;j<=n-1;j++)
        {
            if (i+sz-1>=n || j+sz-1>=n)
            break;
            
            if (Okay(sz,i,j))
            {
                X=i;
                Y=j;
                return true;
            }
        }
    }
    
    return false;
}

int main()
{
    int i,j;
    int l,r,mid,best;
    int x,y;
    
    scanf("%d",&n);
    
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            scanf("%d",&gr[i][j]);
        }
    }
    
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            SumUp[i][j]=SumUp[i][j-1];
            SumDown[i][j]=SumDown[i][j-1];
            
            SumLeft[i][j]=SumLeft[i-1][j];
            SumRight[i][j]=SumRight[i-1][j];
            
            if (gr[i][j]==gr[i-1][j])
            {
                SumUp[i][j]++;
            }
            else if (gr[i][j]==gr[i+1][j])
            {
                SumDown[i][j]++;
            }
            else if (gr[i][j]==gr[i][j+1])
            {
                SumRight[i][j]++;
            }
            else
            {
                SumLeft[i][j]++;
            }
        }
    }
    
    l=1;
    r=n/2;
    
    while(l<=r)
    {
        mid=(l+r)/2;
        
        if (Try(2*mid))
        {
            best=mid;
            x=X;
            y=Y;
            
            l=mid+1;
        }
        else
        {
            r=mid-1;
        }
    }
    
    printf("%d %d %d\n",best*2,x,y);
    
    return 0;
}

/**
6
1 1 4 4 13 14
2 3 3 5 13 14
2 6 7 5 12 12
9 6 7 10 10 15
9 8 8 11 11 15
16 16 17 17 18 18
**/