hdu 1671

#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <cstdlib>
#include <limits.h>
#include <string.h>
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

int lowbit(int t){return t&(-t);}
int countbit(int t){return (t==0)?0:(1+countbit(t&(t-1)));}
int gcd(int a,int b){return (b==0)?a:gcd(b,a%b);}
#define LL long long
#define MIN INT_MIN
#define MAX INT_MAX
#define PI acos(-1.0)
#define FRE freopen("input.txt","r",stdin)
#define FF freopen("output.txt","w",stdout)
#define N 1001
char g[N][N];
int x[N],y[N];
int main(){
    int t;
    scanf("%d",&t);
    int ca=1;
    while(t--){
        int n;
        scanf("%d",&n);
        int i,j;
        for(i=0;i<=n;i++){
                x[i] = y[i] = 0;
        }
        for(i=1;i<=n;i++){
            scanf("%s",g[i]+1);
        }
        int m;
        scanf("%d",&m);
        while(m--){
            int a,b;
            scanf("%d%d",&a,&b);
            x[a]++;
            y[b]++;
        }
        int ans=0;
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                if((x[i]+y[j])%2 ==0 && g[i][j] == 'w')ans++;
                if((x[i]+y[j])%2 ==1 && g[i][j] == 'b')ans++;
            }
        }
        printf("Case #%d: %d\n",ca++,ans);
    }
    return 0;
}