#include <algorithm>
#include <fstream>
#include <iostream>
using namespace std;
const int MAX_N = 2004;

int a[MAX_N][MAX_N];
int c[MAX_N][MAX_N];
int d[MAX_N][MAX_N];
int e[MAX_N][MAX_N];
int f[MAX_N][MAX_N];


int main () {
    ///ifstream cin("f.in");
    int n;

    cin >> n;
    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= n; ++ j) {
            cin >> a[i][j];
        }
    }

    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= n; ++ j) {

            if (a[i][j] == a[i][j + 1]) {
                c[i][j] = 0;
            } else {
                c[i][j] = c[i - 1][j] + 1;
            }

            if (a[i][j] == a[i][j - 1]) {
                d[i][j] = 0;
            } else {
                d[i][j] = d[i - 1][j] + 1;
            }

            if (a[i][j] == a[i + 1][j]) {
                e[i][j] = 0;
            } else {
                e[i][j] = e[i][j - 1] + 1;
            }

            if (a[i][j] == a[i - 1][j]) {
                f[i][j] = 0;
            } else {
                f[i][j] = f[i][j - 1] + 1;
            }

        }
    }

    for (int length = n - 2; length >= 2; length -= 2) {
        for (int i = 2; i <= n - length; ++ i) {
            for (int j = 2; j <= n - length; ++ j) {
                if (f[i][j + length - 1] >= length &&
                    e[i + length - 1][j + length - 1] >= length &&
                    d[i + length - 1][j] >= length &&
                    c[i + length - 1][j + length - 1] >= length) {
                        cout << length << " " << i << " " << j << "\n";
                        return 0;
                }
            }
        }
    }

    return 0;
}
