#include <iostream>
using namespace std;
int wall[2002][2002];
int n;

void Solve()
{
    int d=0,i=0,j=0;
    for(int ii=1;ii<n-2;ii++)
        for(int jj=1;jj<n-2;jj++)
        {            
            for(int dd = 2;dd<n-max(ii,jj);dd+=2)
            {
                bool check=true;
                for(int t=0;t<dd && check;t++)
                {
                    if(wall[ii+t][jj-1]==wall[ii+t][jj])check = false;
                    if(wall[ii+t][jj+dd] == wall[ii+t][jj+dd-1])check=false;
                    if(wall[ii-1][jj+t] == wall[ii][jj+t])check=false;
                    if(wall[ii+dd][jj+t] == wall[ii+dd-1][jj+t])check=false;
                }
                if(check)
                {
                    if(d<dd)
                    {
                        d=dd;
                        i=ii;
                        j=jj;
                    }
                }
            }
        }
    cout<<d<<" "<<i+1<<" "<<j+1<<endl;
}

int main ()
{
	cin>>n;
	for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        {
            cin>>wall[i][j];
        }
    Solve();
	return 0;
}