//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
struct node{
int tree[3005];
int buf=1500;
node (){
memset(tree,0,sizeof(tree));
}
void update(int i,int j,int k){
i+=buf,j+=buf+1;
for (;i<j;i>>=1,j>>=1){
if (i&1){
tree[i]+=k;
i++;
}
if (j&1){
tree[j-1]+=k;
j--;
}
}
}
int query(int i){
i+=buf;
int res=0;
while (i){
res+=tree[i];
i>>=1;
}
return res;
}
} *root[1505];
int n;
int arr[1505][1505];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n;
rep(x,1,n+1) rep(y,1,n+1) cin>>arr[x][y];
rep(x,0,1505) root[x]=new node();
ll ans=0;
rep(x,1,n+1) rep(y,1,n+1){
int temp=max(root[x]->query(y-1),root[x-1]->query(y))+arr[x][y];
root[x]->update(y,y,temp);
ans+=temp;
}
cout<<ans<<endl;
char c;
int a,b;
rep(x,0,n){
cin>>c>>a>>b;
if (c=='U'){
arr[a][b]++;
int l=b,r=b;
rep(y,a,n+1){
while (r!=n && root[y]->query(r)+arr[y][r+1]==root[y]->query(r+1)){
r++;
}
while (l<=r && root[y]->query(l)==
max(root[y-1]->query(l),root[y]->query(l-1))+arr[y][l]){
l++;
}
if (r<l) break;
root[y]->update(l,r,1);
ans+=(r-l+1);
}
}
else{
arr[a][b]--;
int l=b,r=b;
rep(y,a,n+1){
while (r!=n && root[y-1]->query(r+1)+arr[y][r+1]!=root[y]->query(r+1)){
r++;
}
while (l<=r && root[y]->query(l)==
max(root[y-1]->query(l),root[y]->query(l-1))+arr[y][l]){
l++;
}
if (r<l) break;
root[y]->update(l,r,-1);
ans-=(r-l+1);
}
}
cout<<ans<<endl;
}
}
