#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

#define N 210

int father[N<<],tmp[N<<],n,m,a[N][N];

struct Node{

    int l,r;

    int le[N],ri[N];

    int lb[N],rb[N];

    int s0,s1;

}tree[N<<];

inline int find(int x){

    if(father[x]!=x)father[x]=find(father[x]);

    return father[x];

}

void update(int rt){

    tree[rt].s0=tree[rt<<].s0+tree[rt<<|].s0;

    tree[rt].s1=tree[rt<<].s1+tree[rt<<|].s1;

    memcpy(tree[rt].lb,tree[rt<<].lb,sizeof tree[rt].lb);

    memcpy(tree[rt].rb,tree[rt<<|].rb,sizeof tree[rt].rb);

    for(int i=;i<=n<<;i++) father[i]=i;

    for(int i=;i<=n;i++) tree[rt<<|].le[i]+=*n,tree[rt<<|].ri[i]+=*n;

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

        int x=tree[rt<<].ri[i],y=tree[rt<<|].le[i];

        if(find(x)!=find(y)&&tree[rt<<].rb[i]==tree[rt<<|].lb[i]){

            father[find(x)]=find(y);

            if(tree[rt<<].rb[i]){

                tree[rt].s1--;

            }else{

                tree[rt].s0--;

            }

        }

    }

    for(int i=;i<=n;i++) tree[rt].le[i]=find(tree[rt<<].le[i]),

    tree[rt].ri[i]=find(tree[rt<<|].ri[i]);

    for(int i=;i<=n;i++) tmp[i<<]=tree[rt].le[i],tmp[(i<<)-]=tree[rt].ri[i];

    sort(tmp+,tmp++*n);

    int mxdata=unique(tmp+,tmp++*n)-tmp-;

    for(int i=;i<=n;i++) tree[rt].le[i]=lower_bound(tmp+,tmp++mxdata,

    tree[rt].le[i])-tmp,tree[rt].ri[i]=lower_bound(tmp+,tmp++mxdata,tree[rt].ri[i])-tmp;

    for(int i=;i<=n;i++) tree[rt<<|].le[i]-=*n,tree[rt<<|].ri[i]-=*n;

}

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

    tree[rt].l=l;tree[rt].r=r;

    if(l==r){

        int tot=;

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

        {

            if(a[i][l]!=a[i-][l])

            {

                tot++;

                if(a[i][l]) tree[rt].s1++;

                else tree[rt].s0++;

            }

            tree[rt].le[i]=tree[rt].ri[i]=tot;

            tree[rt].lb[i]=tree[rt].rb[i]=a[i][l];

        }

        return;

    }

    int mid=(l+r)>>;

    build(l,mid,rt<<);

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

    update(rt);

}

void modify(int rt,int pos)

{

    if(tree[rt].l==tree[rt].r)

    {

        int tot=;tree[rt].s1=;tree[rt].s0=;

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

        {

            if(a[i][pos]!=a[i-][pos])

            {

                tot++;

                if(a[i][pos]) tree[rt].s1++;

                else tree[rt].s0++;

            }

            tree[rt].le[i]=tree[rt].ri[i]=tot;

            tree[rt].lb[i]=tree[rt].rb[i]=a[i][pos];

        }

        return;

    }

    int mid=(tree[rt].l+tree[rt].r)>>;

    if(pos<=mid) modify(rt<<,pos);

    else modify(rt<<|,pos);

    update(rt);

}

int main(){

    scanf("%d",&n);

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

        a[][i]=-;

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

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

        }

    }

    build(,n,);

    scanf("%d",&m);

    while(m--){

        int x,y;

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

        a[x][y]^=;

        modify(,y);

        printf("%d %d\n",tree[].s1,tree[].s0);

    }

    return ;

}