E.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 61)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

ll n, k, grid[30][30];

int main()
{
    fastio;
    cin >> n;

    for1(i, n) {
        for1(j, n) {

            if(i & 1)
                cout << 0 << " ";
            else {
                ll val = (1LL << (i+j));
                grid[i][j] = val;
                cout << val << " ";
            }
        }
        cout << endl;
    }

    ll q;
    cin >> q;
    while(q--) {
        cin >> k;

        ll r = 1, c = 1;
        cout << r << " " << c << endl;

        for1(i, n+n-2) {
            ll x = i+2;
            ll v = k & (1LL << x);

            if(r < n && grid[r+1][c] == v)
                r++;
            else
                c++;

            cout << r << " " << c << endl;
        }
    }

    return 0;
}