/**
 * @author : cyb1010
 * @date   : 2024-01-19 08:22:06
 * @file   : set.cpp
 */
#include <bits/stdc++.h>
using namespace std;
#define fo(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
#define fi first
#define se second
typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
typedef bitset<2048> BS;
int __, n, l, cnt;
BS B[11][2048], tot, a[2048], ans[2048];
void perf(int p, int q, BS *x, BS *y) {
    for (int i = 0; i < l; i++)
        y[(i + p) & (l - 1)] ^= ((x[i] << q) | (x[i] >> (l - q)));
    for (int i = 0; i < l; i++) y[i] &= tot;
}
int main() {
    // fo("set");
    cin.tie(0)->sync_with_stdio(0);
    cin >> n, l = 1 << n, B[0][0].set(0);
    for (int i = 0; i < l; i++) tot.set(i);
    for (int i = 1; i < n; i++) {
        perf(0, 0, B[i - 1], B[i]);
        perf(1 << i - 1, 0, B[i - 1], B[i]);
        perf(l - (1 << i - 1), 0, B[i - 1], B[i]);
        perf(0, 1 << i - 1, B[i - 1], B[i]);
        perf(0, l - (1 << i - 1), B[i - 1], B[i]);
    }
    for (int i = 0, x; i < l; i++)
        for (int j = 0; j < l; j++)
            cin >> x, (x && (perf(i, j, B[n - 1], ans), 1));
    // for (int _ = 0; _ < n; _++)
    //     for (int i = 0, x; i < l; i++)
    //         for (int j = 0; j < l; j++) cerr << B[_][i][j] << " \n"[j == l - 1];
    for (int i = 0; i < l; i++) cnt += ans[i].count();
    cout << cnt << endl;
    for (int i = 0; i < l; i++)
        for (auto j = ans[i]._Find_first(); j < l; j = ans[i]._Find_next(j))
            cout << i << " " << j << "\n";
    return 0 ^ __ ^ 0;
}