#include <bits/stdc++.h>
using namespace std;
inline int read() {
    int x(0);
    char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    while (c <= '9' && c >= '0') x = (x << 3) + (x << 1) + c - 48, c = getchar();
    return x;
}
inline void write(int x) {
    static int sta[35];
    int top = 0;
    do {
        sta[top++] = x % 10, x /= 10;
    } while (x);
    while (top) putchar(sta[--top] + 48);  // 48 是 '0'
    putchar(' ');
}
const int N = 2100;
int n, nn;
bitset<N << 1> mp[N], mpp[N], vis[N];
const int dx[5] = { 0, 0, 0, 1, -1 };
const int dy[5] = { 0, 1, -1, 0, 0 };
inline void qwq(int x, int y, bool q) {
    if (q)
        vis[x][y].flip();
    for (int i = 0; i < 5; i++) mp[(x + dx[i] + nn) % nn][(y + dy[i] + nn) % nn].flip();
}
inline void print() {
    for (int i = 0; i < nn; i++) {
        for (int j = 0; j < nn; j++) cerr << mp[i][j];
        cerr << endl;
    }
    cerr << "-------------" << endl;
}
inline void awa(int q) {
    for (int i = 1; i < nn; i++) {
        for (int j = 0; j < nn; j++)
            if (mp[i - 1][j])
                qwq(i, j, q);
        // print();
    }
}
bitset<N << 1> base[N << 1], tmp, ans[N << 1], p[N << 1];
inline void insert(bitset<N << 1>& x, int id) {
    bitset<N << 1> qwq;
    for (int i = (nn << 1) - 1; ~i; i--) {
        if (!x[i])
            continue;
        if (p[i] == 0) {
            p[i] = x;
            ans[i] = qwq.flip(id);
            break;
        }
        x ^= p[i];
        qwq = qwq ^ ans[i];
    }
}
int main() {
    srand(time(0));
    n = read();
    nn = 1 << n;
    qwq(0, 0, 0);
    awa(0);
    for (int i = 0; i < nn; i++) {
        base[i] = (mp[0] << nn) | mp[nn - 1];
        mp[0] <<= 1;
        mp[0][0] = mp[0][nn];
        mp[0][nn] = 0;
        mp[nn - 1] <<= 1;
        mp[nn - 1][0] = mp[nn - 1][nn];
        mp[nn - 1][nn] = 0;
    }
    for (int i = 0; i < nn; i++) mp[i].reset();
    qwq(nn - 1, 0, 0);
    awa(0);
    for (int i = nn; i < nn << 1; i++) {
        base[i] = (mp[0] << nn) | mp[nn - 1];
        mp[0] <<= 1;
        mp[0][0] = mp[0][nn];
        mp[0][nn] = 0;
        mp[nn - 1] <<= 1;
        mp[nn - 1][0] = mp[nn - 1][nn];
        mp[nn - 1][nn] = 0;
    }

    // for(int i=0;i<nn<<1;i++)
    // {
    //     for(int j=0;j<nn<<1;j++)
    //     cerr<<base[i][j];cerr<<endl;
    // }

    for (int i = 0; i < nn << 1; i++) insert(base[i], i);

    // for(int i=0;i<nn<<1;i++)
    // {
    //     for(int j=0;j<nn<<1;j++)
    //     cerr<<ans[i][j];cerr<<":";
    //     for(int j=0;j<nn<<1;j++)
    //     cerr<<p[i][j];cerr<<endl;
    // }

    for (int i = 0; i < nn; i++)
        for (int j = 0; j < nn; j++) mpp[i][j] = mp[i][j] = read();
    awa(0);
    tmp = (mp[0] << nn) | mp[nn - 1];
    bitset<N << 1> qans;
    // for(int i=(nn<<1)-1;~i;i--)cerr<<tmp[i];cerr<<endl;
    for (int i = (nn << 1) - 1; ~i; i--) {
        if (!tmp[i])
            continue;
        tmp ^= p[i];
        qans ^= ans[i];
    }
    // for(int i=(nn<<1)-1;~i;i--)cerr<<qans[i];

    for (int i = 0; i < nn; i++)
        for (int j = 0; j < nn; j++) mp[i][j] = mpp[i][j];
    for (int i = 0; i < nn; i++) vis[i].reset();
    for (int i = 0; i < nn << 1; i++)
        if (qans[i]) {
            if (i < nn)
                qwq(0, i, 1);
            else
                qwq(nn - 1, i - nn, 1);
        }
    awa(1);
    // for(int i=0;i<nn;i++)
    // {
    //     for(int j=0;j<nn;j++)cerr<<mp[i][j];
    //     cerr<<endl;
    // }
    // cerr<<"-------------"<<endl;
    int tot = 0;
    for (int i = 0; i < nn; i++) tot += vis[i].count();
    printf("%d\n", tot);
    for (int i = 0; i < nn; i++)
        for (int j = vis[i]._Find_first(); j < nn; j = vis[i]._Find_next(j)) write(i), write(j), puts("");
    return 0;
}