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

int a[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];
            a[i][j] = a[i][j] ^ a[i - 1][j] ^ a[i][j - 1] ^ a[i - 1][j - 1];
        }
    }
    for (int length = n - 2; length >= 2; length -= 2) {
        for (int i = length + 1; i < n; ++ i) {
            for (int j = length + 1; j < n; ++ j) {
                if ((a[i][j] ^ a[i - length][j] ^ a[i][j - length] ^ a[i - length][j - length]) == 0) {
                    cout << length << " " << i - length + 1 << " " << j - length + 1 << "\n";
                    return 0;
                }
            }
        }
    }
    return 0;
}
