#include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
typedef long long ll;
inline int ri() {
	int x = 0;
	char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return x;
}
const int _ = 2e3 + 5;
int n, a[_][_], b[_][_], c[_], d[_], e[_];
signed main() {
	int z = ri();
	n = 1 << z;
	F(i, 1, n) F(j, 1, n) a[i][j] = ri();
	if(n == 1) {
		F(i, 1, n) {
			F(j, 1, n) printf("%d ", a[i][j]);
			printf("\n");
		}
		return 0;
	}
	auto work = [&](int len1) -> void {
		F(i, 1, n) F(j, 1, n) b[i][j] = 0;
		F(i, 1, n) F(j, 1, n) {
			b[i][j] = a[i][j];
			int x = i - len1, y = j; if(x < 1) x += n; b[i][j] ^= a[x][y];
			x = i + len1, y = j; if(x > n) x -= n; b[i][j] ^= a[x][y];
			x = i, y = j - len1; if(y < 1) y += n; b[i][j] ^= a[x][y];
			x = i, y = j + len1; if(y > n) y -= n; b[i][j] ^= a[x][y];
		}
		F(i, 1, n) F(j, 1, n) a[i][j] = b[i][j];
	};
	dF(i, z - 1, 0) {
		work(1 << i);
	}
	int s = 0;
	F(i, 1, n) F(j, 1, n) s += a[i][j];
	cout << s << '\n';
	F(i, 1, n) {
		F(j, 1, n) if(a[i][j]) {
			cout << i - 1 << ' ' << j - 1 << '\n';
		}
	}
	return 0;
}

/*
2
0 0 1 1
1 0 1 0
0 0 0 0
1 1 1 0
*/