#include <cstdio>
using namespace std;
int n,i,j,i1,j1,l1,c1,max1,l,bun,a[2005][2005];
int main()
{
    //freopen("date.in","r",stdin);
    //freopen("date.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=2;i<=n-2;i++)
        for(j=2;j<=n-2;j++)
        {
            if(a[i][j]==a[i][j+1]||a[i][j]==a[i+1][j])
            {
                bun=1;
                //if(n-i<n-j)l=n-j;
                //else l=n-i;
                l=2;
                while(i+l-1<n)
                {
                    bun=1;
                    if(i+l-1==n||j+l-1==n)bun=0;
                    else
                    {
                        /*if(a[i][j+l-1]==a[i-1][j+l-1]||a[i][j+l-1]==a[i][j+l])bun=0;
                        if(a[i+l-1][j]==a[i+l-1][j-1]||a[i+l][j]==a[i+l-1][j])bun=0;
                        if(a[i+l-1][j+l-1]==a[i+l-1][j+l]||a[i+l-1][j+l-1]==a[i+l][j+l-1])bun=0;*/
                        for(i1=i;i1<=i+l-1;i1++)
                        {
                            if(a[i1][j-1]==a[i1][j])bun=0;
                            if(a[i1][j+l-1]==a[i1][j+l])bun=0;
                        }
                        for(j1=j;j1<=j+l-1;j1++)
                        {
                            if(a[i][j1]==a[i-1][j1])bun=0;
                            if(a[i+l-1][j1]==a[i+l][j1])bun=0;
                        }
                    }
                    if(bun==1)
                    {
                        if(l>max1)
                        {
                            max1=l;
                            l1=i;
                            c1=j;
                        }

                    }
                    l++;
                }
            }
        }
    printf("%d %d %d\n",max1,l1,c1);
    return 0;
}
