#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
#define int long long
#define ull unsigned long long
#define Arr std::vector
#define Ptn std::pair
#define fi first
#define se second
#define eb emplace_back
#define pb push_back
#define popc(x) __builtin_popcount(x)
#define FILE(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
#define TEST(x) freopen(x ".in", "r", stdin), freopen("test.out", "w", stdout)
#define debug std::cout << "Running on " << __FUNCTION__ << ' ' << __LINE__ << std::endl;
const int INF = 0x3f3f3f3f;
const int N = 11;
int n, a[2][1 << N][1 << N];
inline int read()
{
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        w = (w << 3) + (w << 1) + (ch - 48);
        ch = getchar();
    }
    return w * f;
}

signed main()
{
 //   FILE("set");
    n = read(); int nn = (1 << n); int op = 0;
    for (int i = 0; i < nn; i++) for (int j = 0; j < nn; j++) a[op][i][j] = read();
    for (int w = nn / 2; w >= 2; w >>= 1)
    {
        op ^= 1; memset(a[op], 0, sizeof(a[op]));
        for (int i = 0; i < nn; i++)
        {
            for (int j = 0; j < nn; j++)
            {
                if (a[op ^ 1][i][j])
                {
                    int l = ((j - w) + j) >> 1, r = ((j + w) + j) >> 1, u = ((i + w) + i) >> 1, 
                    d = ((i - w) + i) >> 1;
                    l = (l < 0 ? l + nn : l); 
                    r = (r >= nn ? r - nn : r);
                    u = (u >= nn ? u - nn : u);
                    d = (d < 0 ? d + nn : d);
                    a[op][i][l] ^= 1; a[op][i][r] ^= 1;
                    a[op][u][j] ^= 1; a[op][d][j] ^= 1;
                    a[op][i][j] ^= 1;
                } 
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < nn; i++) for (int j = 0; j < nn; j++) ans += a[op][i][j];
    printf("%lld\n", ans);
    for (int i = 0; i < nn; i++) for (int j = 0; j < nn; j++) if (a[op][i][j]) printf("%lld %lld\n", i, j);
    return 0;
}