#include<iostream>
#include<ios>
using namespace std;

int w[2000][2000],  x, bestX = 0, bestY = 0, bestSize = 0;

int main() {
    //cin.tie(NULL);
    ios::sync_with_stdio(false);

    cin >> x;
    for(int n = 0; n < x; n++)
        for(int m = 0; m < x; m++) cin >> w[n][m];
    for(int s = 2; s < x; s += 2) {
        for(int n = 1; n+s-1 < x-1; n++)
            for(int m = 1; m+s-1 < x-1; m++) {
                if(w[n][m] == w[n-1][m] ||
                   w[n][m] == w[n][m-1] ||

                   w[n][m+s-1] == w[n][m+s] ||
                   w[n][m+s-1] == w[n-1][m+s-1] ||

                   w[n+s-1][m+s-1] == w[n+s-1][m+s] ||
                   w[n+s-1][m+s-1] == w[n+s][m+s-1] ||

                   w[n+s-1][m] == w[n+s][m] ||
                   w[n+s-1][m] == w[n+s-1][m-1]) break;

                for(int p = 1; p < s-1; p++)
                    if(w[n][m+p] == w[n-1][m+p] ||
                       w[n+p][m+s-1] == w[n+p][m+s] ||
                       w[n+s-1][m+p] == w[n+s][m+p] ||
                       w[n+p][m] == w[n+p][m-1]) break;
                if(bestSize <= s)
                    bestX = n+1, bestY = m+1, bestSize = s;
            }
    }
    cout << bestSize  << ' ' << bestX << ' ' << bestY << '\n';
    return 0;
}
