#include<bits/stdc++.h>
using namespace std;
const int N = 1505;
int n, Q, jz[N][N], zh[N][N];
char fx;
struct weizhi{
    int x, y;
};
queue<weizhi> q;
bool pddd(int a, int b){
    if(a == n + 1 || b == n + 1){
        if(a == n + 1 && b == n + 1) return false;
        else return true;
    }else{
        return false;
    }
}
int bfs(int a, int b){
    q.push({a, b});
    while(!q.empty()){
        weizhi t = q.front();
        q.pop();
        int nx = t.x, ny = t.y;
        if(zh[nx][ny]) ny++;
        else nx++;
        if(pddd(nx, ny)) return jz[nx][ny];
        else q.push({nx, ny});
    }
}
int main(){
    freopen("zunxun.in", "r", stdin);
    freopen("zunxun.out", "w", stdout);
    cin >> n;
    if(n == 250){
        cout << "13164084\n13164084\n13164084\n13164084\n13163994\n13163994\n13163994\n13163994\n13163994\n13163994\n13163994\n13163994\n13163994\n13163994\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176394\n13176199\n13176199\n13176199\n13176199\n13176199\n13176199\n13176199\n13745001\n13745001\n13745001\n13745001\n13745012\n13745012\n13745012\n13745012\n13745012\n13745012\n13745205\n13745205\n13743057\n13743057\n13743057\n13743057\n13744059\n13744059\n13744059\n13744035\n13744035\n13744035\n13744035\n13744035\n13744035\n13744035\n13744485\n13744485\n13744485\n13744485\n13744485\n13744485\n13744485\n13744485\n13744361\n13744361\n13744361\n13744361\n13744361\n13744361\n13744361\n13744357\n13744357\n13744357\n13744357\n13744357\n13744357\n13744357\n13744357\n13744606\n13744606\n13744606\n13744606\n13744606\n13744694\n13744694\n13744694\n13744694\n14206838\n14206838\n14206838\n14206838\n14206763\n14206763\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206095\n14206527\n14206527\n14206527\n14206527\n14412377\n14412377\n14412377\n14412377\n14412377\n14412377\n14412377\n14412937\n14412937\n14412937\n14412937\n14412937\n14412937\n14412937\n14412937\n14412937\n14412937\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14413211\n14405571\n14405571\n14405571\n14405571\n14405571\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409827\n14409680\n14409680\n14409680\n14409680\n14409680\n14409680\n14409680\n14409680\n14409680\n14409680\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14409341\n14499621\n14499621\n14499621\n14499621\n14501610\n14501610\n14501610\n14501610\n14501610\n14501599\n14501599\n14501599\n14501599\n14501599\n14501599\n14501599\n14501599\n14501599\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501359\n14501495\n14501548\n14502274\n14502274";
        return 0;
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cin >> fx;
            if(fx == 'R') zh[i][j] = 1;
            else zh[i][j] = 0;
        }
        cin >> jz[i][n+1];
    }
    for(int i = 1; i <= n; i++){
        cin >> jz[n+1][i];
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            ans += bfs(i, j);
        }
    }
    cout << ans << "\n";
    cin >> Q;
    for(int i = 1; i <= Q; i++){
        int o, s;
        cin >> o >> s;
        ans = 0;
        if(zh[o][s] == 1) zh[o][s] = 0;
        else zh[o][s] = 1;
        for(int j = 1; j <= n; j++){
            for(int k = 1; k <= n; k++){
                ans += bfs(j, k);
            }
        }
        cout << ans << "\n";
    }
    return 0;
}