#include<iostream>
#include<cstdio>
using namespace std;
long long n,i,j,i1,j1,fl,k;
long long a[2005][2005];
int main()
{
  cin>>n;

  for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
      scanf("%lld",&a[i][j]);

  k = n-2;
  while(1)
  {
    for(i=2;i<=n-k;i++)
      for(j=2;j<=n-k;j++)
      {
        fl = 0;
        for(j1=j;j1<=j+k-1;j1++)
        {
          if(j1 == j)
            if(a[i][j1] == a[i][j1-1])
            {
              fl = 1;
              break;
            }
          if(j1 == j+k-1)
            if(a[i][j1] == a[i][j1+1])
            {
              fl = 1;
              break;
            }
          if(a[i][j1] == a[i-1][j1])
          {
            fl = 1;
            break;
          }
        }

        if(fl == 1)
          continue;

        for(i1=i;i1<=i+k-1;i1++)
        {
          if(i1 == i)
            if(a[i1][j+k-1] == a[i1-1][j+k-1])
            {
              fl = 1;
              break;
            }
          if(i1 == i1+k-1)
            if(a[i1+1][j+k-1] == a[i1+1][j+k-1])
            {
              fl = 1;
              break;
            }
          if(a[i1][j+k-1] == a[i1][j+k])
          {
            fl = 1;
            break;
          }
        }

        if(fl == 1)
          continue;

        for(j1=j;j1<=j+k-1;j1++)
        {
          if(j1 == j)
            if(a[i+k-1][j1] == a[i+k-1][j1-1])
            {
              fl = 1;
              break;
            }
          if(j1 == j+k-1)
            if(a[i+k-1][j1] == a[i+k-1][j1+1])
            {
              fl = 1;
              break;
            }
          if(a[i+k-1][j1] == a[i+k][j1])
          {
            fl = 1;
            break;
          }
        }

        if(fl == 1)
          continue;

        for(i1=i;i1<=i+k-1;i1++)
        {
          if(i1 == i)
            if(a[i1][j] == a[i1-1][j])
            {
              fl = 1;
              break;
            }
          if(i1 == i1+k-1)
            if(a[i1+1][j] == a[i1+1][j])
            {
              fl = 1;
              break;
            }
          if(a[i1][j] == a[i1][j-1])
          {
            fl = 1;
            break;
          }
        }

        if(fl == 0)
        {
          cout<<k<<" "<<i<<" "<<j<<endl;
          return 0;
        }

      }

    k--;
  }
}
/*
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
*/
