#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define ull unsigned long long

#define mst(a,b) memset((a),(b),sizeof(a))

#define mp(a,b) make_pair(a,b)

#define pi acos(-1)

#define pii pair<int,int>

#define pb push_back

const int INF = 0x3f3f3f3f;

const double eps = 1e-;

const int MAXN = 3e5 + ;

const int MAXM = 1e7 + ;

const ll mod = 1e9 + ;

int n, m;

int s[][], fa[ * ];

int id(int x,int y) {

    return x * n + y;

}

int findd(int x) {

    return x == fa[x] ? x : fa[x] = findd(fa[x]);

}

struct node {

    int l[],r[],ans[];

}st[<<];

node mergee(node &a,node &b,int mid) {

    node c;

    for(int i = ; i <= n; i++) {

        c.l[i] = a.l[i], c.r[i] = b.r[i];

        fa[a.l[i]] = a.l[i], fa[a.r[i]] = a.r[i];

        fa[b.l[i]] = b.l[i], fa[b.r[i]] = b.r[i];

    }

    for(int i = ; i < ; i++) c.ans[i] = a.ans[i] + b.ans[i];

    for(int i = ; i <= n; i++) {

        if(s[i][mid] == s[i][mid + ]) {

            int x = findd(a.r[i]), y = findd(b.l[i]);

            if(x == y) continue;

            c.ans[s[i][mid]]--, fa[x] = y;

        }

    }

    for(int i = ; i <= n; i++) {

        c.l[i] = findd(c.l[i]);

        c.r[i] = findd(c.r[i]);

    }

    return c;

}

void build(int rt,int l,int r) {

    if(l == r) {

        st[rt].ans[] = st[rt].ans[] = ;

        for(int i = ; i <= n; i++) {

            st[rt].l[i] = st[rt].r[i] = fa[id(i,l)] = id(i,l);

            st[rt].ans[s[i][l]]++;

        }

        for(int i = ; i <= n; i++) {

            if(s[i][l] == s[i - ][l]) {

                st[rt].l[i] = st[rt].r[i] = fa[id(i,l)] = fa[id(i - ,l)];

                st[rt].ans[s[i][l]]--;

            }

        }

        return ;

    }

    int mid = (l + r) >> ;

    build(rt<<,l,mid);

    build(rt<<|,mid + ,r);

    st[rt] = mergee(st[rt<<],st[rt<<|],mid);

}

void update(int rt,int l,int r,int pos) {

    if(l == r) {

        st[rt].ans[] = st[rt].ans[] = ;

        for(int i = ; i <= n; i++) {

            st[rt].l[i] = st[rt].r[i] = fa[id(i,l)] = id(i,l);

            st[rt].ans[s[i][l]]++;

        }

        for(int i = ; i <= n; i++) {

            if(s[i][l] == s[i - ][l]) {

                st[rt].l[i] = st[rt].r[i] = fa[id(i,l)] = fa[id(i - ,l)];

                st[rt].ans[s[i][l]]--;

            }

        }

        return ;

    }

    int mid = (l + r) >> ;

    if(pos <= mid) update(rt<<,l,mid,pos);

    else update(rt<<|,mid + ,r,pos);

    st[rt] = mergee(st[rt<<],st[rt<<|],mid);

}

int main() {

#ifdef local

    freopen("data.txt", "r", stdin);

//    freopen("data.txt", "w", stdout);

#endif

    scanf("%d",&n);

    for(int i = ; i <= n; i++)

        for(int j = ; j <= n; j++)

            scanf("%d",&s[i][j]);

    build(,,n);

    scanf("%d",&m);

    while(m--) {

        int x,y;

        scanf("%d%d",&x,&y);

        s[x][y] ^= ;

        update(,,n,y);

        printf("%d %d\n",st[].ans[],st[].ans[]);

    }

    return ;

}