#include<cstdio>
#include<vector>
using namespace std;

int N, maxi, X, Y, mi[2009], a[2009][2009], up[2009][2009], down[2009][2009], left[2009][2009], right[2009][2009];

int main()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);
scanf ("%d", &N);
for (int i=1; i<=N; i++)
    for (int j=1; j<=N; j++)
        scanf ("%d", &a[i][j]);
for (int i=2; i<=N; i++)
    for (int j=2; j<=N; j++)
    {
        if (a[i][j-1] != a[i-1][j-1]) left[i][j] = left[i][j-1] + 1;
        else left[i][j] = 0;
        if (a[i-1][j-1] != a[i-1][j]) up[i][j] = up[i-1][j] + 1;
        else up[i][j] = 0;
    }
for (int i=N; i>=2; i--)
    for (int j=N; j>=2; j--)
    {
        if (a[i][j] != a[i-1][j]) right[i][j] = right[i][j+1] + 1;
        else right[i][j] = 0;
        if (a[i][j] != a[i][j-1]) down[i][j] = down[i+1][j] + 1;
        else down[i][j] = 0;
    }
for (int diag = 5; diag <= 2*N-1; diag++)
{
    if (diag == 6)
        diag = 6;
    for (int i=2; i<=N; i++)
        if (diag - i >= 2 && diag - i <= N)
            mi[i] = min (left[i][diag-i], down[i][diag-i]) + i;
        else mi[i] = 0;
    for (int i=2; i<=N; i++)
    {
        int j = diag - i, MI, st, dr;
        MI = min (up[i][j], right[i][j]);
        //// il am pe mi2
        dr = i;
        st = i - MI;
        for (int j=st; j<=dr; j++)
            if (mi[j] >= i)
            {
                if (i - j > maxi)
                {
                    maxi = i-j;
                    X = i - maxi;
                    Y = diag - i;
                }
                break;
            }
    }
}
printf ("%d %d %d\n", maxi, X, Y);
return 0;
}
