#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];
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[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;
                for (int i1 = i; i1 < i + sz; i1++) {
                    if (a[i1][j] == a[i1][j - 1]) {
                        ok = false;
                        break;
                    }
                    
                    if (a[i1][j + sz - 1] == a[i1][j + sz]) {
                        ok = false;
                        break;
                    }
                }
                
                if (ok) {
                    for (int j1 = j; j1 < j + sz; j1++) {
                        if (a[i][j1] == a[i - 1][j1]) {
                            ok = false;
                            break;
                        }
                        
                        if (a[i + sz - 1][j1] == a[i + sz][j1]) {
                            ok = false;
                            break;
                        }
                    }
                }
                
                if (ok) {
                    cout << sz << ' ' << i + 1 << ' ' << j + 1 << endl;
                    return 0;
                }
            }
        }
    }
}
