#include<iostream>
using namespace std;
long long n,a[2048][2048];
void read()
{
    int i,j;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            cin>>a[i][j];
        }
    }
}
void solve()
{
    int i,j,k,l,maxi=0,sx,sy,p=0,x,y;
    for(i=2;i<n-1;i++)
    {
        for(j=2;j<n-1;j++)
        {
            if(a[i][j]==a[i][j+1])
            {
                if(a[i+1][j]==a[i+1][j+1])
                {
                    maxi=2;
                    sx=i;
                    sy=j;
                    for(k=i;k<n-1;k++)
                    {
                        for(l=j+2;l<n-1;l++)
                        {
                            if(k>=i+2)l=j;
                            if(a[k][l]!=a[k][l-1]&&a[k][l]!=a[k-1][l])
                            {
                                if(a[k][l]!=a[k][l+1]&&a[k][l]!=a[k+1][l])
                                {
                                    p=1;
                                    break;
                                }
                                if(a[k][l]==a[k][l+1]&&a[k+1][l]!=a[k+1][l+1])
                                {
                                    p=1;
                                    break;
                                }
                                if(a[k][l]==a[k+1][l]&&a[k][l+1]!=a[k+1][l+1])
                                {
                                    p=1;
                                    break;
                                }
                            }
                            x=k;y=l;
                        }
                        if(p)break;
                    }
                }
            }
            if(a[i][j]==a[i+1][j])
            {
                if(a[i][j+1]==a[i+1][j+1])
                {
                    maxi=2;
                    sx=i;
                    sy=j;
                    for(k=i;k<n-1;k++)
                    {
                        for(l=j+2;l<n-1;l++)
                        {
                            if(k>=i+2)l=j;
                            if(a[k][l]!=a[k][l-1]&&a[k][l]!=a[k-1][l])
                            {
                                if(a[k][l]!=a[k][l+1]&&a[k][l]!=a[k+1][l])
                                {
                                    p=1;
                                    break;
                                }
                                if(a[k][l]==a[k][l+1]&&a[k+1][l]!=a[k+1][l+1])
                                {
                                    p=1;
                                    break;
                                }
                                if(a[k][l]==a[k+1][l]&&a[k][l+1]!=a[k+1][l+1])
                                {
                                    p=1;
                                    break;
                                }
                            }
                            x=k;y=l;
                        }
                        if(p)break;
                    }
                }
            }
        }
    }
    if(x-sx==y-sy)maxi=x-sx+2;
    cout<<maxi<<" "<<sx<<" "<<sy<<endl;
}
int main()
{
    read();
    solve();
    return 0;
}