#include<cstdio>

using namespace std;

int l,last,i,j,best,a[2002][2002],b[2002][2002],n,bestx,besty;
bool ok;

bool verif(int x,int y,int lg)
{
    int i,j;
    for(i=x;i<x+lg;i++)
    {
        if(b[i][y]==3||(i==x+lg-1&&b[i][y]==0))
        {
            return false;
        }
    }
    for(i=x;i<x+lg;i++)
    {
        if(b[i][y+lg-1]==1||(i==x+lg-1&&b[i][y+lg-1]==0))
        {
            return false;
        }
    }
    for(j=y;j<y+lg;j++)
    {
        if(b[x+lg-1][j]==0||(j==y+lg-1&&b[x+lg-1][j]==1))
        {
            return false;
        }
    }
    return true;
}

int main()
{
    //freopen("window.in","r",stdin);
    //freopen("window.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            scanf("%d",&a[i][j]);
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            if(!b[i][j])
            {
                if(a[i][j]==a[i+1][j])
                {
                    b[i][j]=0;
                    b[i+1][j]=2;
                }
                if(a[i][j]==a[i][j+1])
                {
                    b[i][j]=1;
                    b[i][j+1]=3;
                }
            }
        }
    }
    for(l=2;l<=n-2;l+=2)
    {
        ok=false;
        for(i=2;i<=n-l&&!ok;i++)
        {
            last=2;
            j=2;
            while(j<n-l+1&&!ok)
            {
                for(;j<last+l-1;j++)
                {
                    if(b[i][j]==2)
                    {
                        break;
                    }
                }
                if((b[i][j]==0||b[i][j]==3)&&j-last==l-1)
                {
                    ok=verif(i,last,l);
                }
                if(ok)
                {
                    break;
                }
                j=last+1;
                last=j+1;
            }
            if(ok)
            {
                best=l;
                bestx=i;
                besty=last;
            }
        }
    }
    printf("%d %d %d\n",best,bestx,besty);
}