#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

typedef long long ll;

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    
    int n;
    cin >> n;
    
    int a[n][n];
    int s1[n][n];
    int s2[n][n];
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
            s1[i][j] = s2[i][j] = 0;
        
            if (j > 0 && i > 0) {
                s1[i][j] = s1[i][j - 1];
                if (a[i][j] == a[i - 1][j]) {
                    ++s1[i][j];                        
                }
                
                s2[i][j] = s2[i - 1][j];
                if (a[i][j] == a[i][j - 1]) {
                    ++s2[i][j];
                }
            }
        }
    }
    
    for (int sz = n - 2; sz > 1; sz--) {
        for (int i = 1; i + sz + 1 <= n; i++) {
            for (int j = 1; j + sz + 1 <= n; j++) {
                bool ok = true;
                
                int i1 = i + sz;
                int j1 = j + sz;
                
                if (s1[i][j1 - 1] - s1[i][j - 1] != 0) ok = false;
                if (s1[i1][j1 - 1] - s1[i1][j - 1] != 0) ok = false;
                if (s2[i1 - 1][j] - s2[i - 1][j] != 0) ok = false;
                if (s2[i1 - 1][j1] - s2[i - 1][j1] != 0) ok = false;
                
                if (ok) {
                    cout << sz << ' ' << i + 1 << ' ' << j + 1 << endl;
                    return 0;
                }
            }
        }
    }
}
