#include <bits/stdc++.h>

using namespace std;

///----------------------------------------------------------

const int BS = ( 1 << 16 );
char buffer[BS];
int position = BS;

inline char getChar()
{
    if ( position == BS )
    {
        position = 0;
        fread( buffer, BS, 1, stdin );
    }

    return buffer[ position++ ];
}

inline int getNr()
{
    int nr = 0;
    char ch;

    do
    {
        ch = getChar();

    } while ( !isdigit( ch ) );

    do
    {
        nr = nr * 10 + ch - '0';
        ch = getChar();

    } while ( isdigit( ch ) );

    return nr;
}

///----------------------------------------------------------

const int Nmax = 2000 + 1;

int stanga[Nmax][Nmax];
int dreapta[Nmax][Nmax];
int jos[Nmax][Nmax];
int sus[Nmax][Nmax];
int A[Nmax][Nmax];

int N;

int query( int a[][Nmax], int x1, int y1, int x2, int y2 )
{
    for ( int i = x1; i <= x2; ++i )
        for ( int j = y1; j <= y2; ++j )
            if ( a[i][j] )
                return 1;

    return 0;
}

int valid( int x, int y, int lg )
{
    int x1 = x, y1 = y;
    int x2 = x + lg - 1, y2 = y + lg - 1;

    for ( int i = y1; i <= y2; ++i )
        if ( A[x1][i] == A[x1 - 1][i] || A[x2][i] == A[x2 + 1][i] )
            return 0;

    for ( int i = x1; i <= x2; ++i )
        if ( A[i][y1] == A[i][y1 - 1] || A[i][y2] == A[i][y2 + 1] )
            return 0;

    return 1;
}

int main()
{
    ///freopen("data.in", "r", stdin);

    N = getNr();

    for ( int i = 1; i <= N; ++i )
        for ( int j = 1; j <= N; ++j )
            A[i][j] = getNr();

    for ( int i = 2; i < N; ++i )
        for ( int j = 2; j < N; ++j )
        {
            if ( A[i - 1][j] == A[i][j] ) sus[i][j] = 1;
            if ( A[i + 1][j] == A[i][j] ) jos[i][j] = 1;
            if ( A[i][j + 1] == A[i][j] ) dreapta[i][j] = 1;
            if ( A[i][j - 1] == A[i][j] ) stanga[i][j] = 1;
        }

    int sol = 0;
    int x = 0, y = 0;

    ///cout << valid( 2, 2, 4 ) << endl;

    for ( int i = 2; i < N; ++i )
        for ( int j = 2; j < N; ++j )
        {
            for ( int k = N - N % 2; k >= 2 && k > sol; k -= 2 )
                if ( i + k <= N && j + k <= N && valid( i, j, k ) )
                {
                    sol = k;
                    x = i;
                    y = j;
                }
        }

    cout << sol << " " << x << " " << y << "\n";

    return 0;
}
