#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;

int n,ans,ok,ok1,d,maxans,maxi,maxj;
pair <int, int > b[1001][1001];


int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            cin>>b[i][j].first;
            ok=0;
            if(b[i-1][j].first==b[i][j].first){ok=1;b[i][j].second=1;b[i-1][j].second=-1;}
            if(b[i][j-1].first==b[i][j].first){ok=1;b[i][j].second=2;b[i][j-1].second=-2;}
            d=min(i,j)-2;
            ans=0;
            if(ok==1)
            for(int k=1;k<=d;k++)
            {
                if(b[i-k][j].second==-2){break;}
                if(b[i][j-k].second==-1){break;}
                ok1=0;
                for(int p=1;p<=k;p++)
                {
                  if(b[i-k][j-p].second==1){ok1=1;break;}
                  if(b[i-p][j-k].second==2){ok1=1;break;}
                }
                if(ok1==0)
                {
                    if(b[i-k][j].second==1){ok1=1;}
                    if(b[i][j-k].second==2){ok1=1;}
                    if(b[i-k][j-k].second==2){ok1=1;}
                }
                if(ok1==0)ans=k;
            }
            if(maxans<ans){maxans=ans;maxi=i-d;maxj=j-d;}

        }
    }
    cout<<maxans+1<<" "<<maxi<<" "<<maxj<<endl;
    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
*/
