#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include <ext/rope>
using namespace __gnu_cxx;
typedef tree<long long, null_type, less<long long>,
rb_tree_tag, tree_order_statistics_node_update> pbds;
//less_equal for identical elements
//#define DEBUG
#ifdef DEBUG
#define debug(...) printf(__VA_ARGS__);
#else
#define debug(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
int n,a[1505][1505],x,y;
char t;
ll s=0,ft[1505][1505];
void up(int r,int c,ll v){
while(c<=n){
ft[r][c]+=v;
c+=c&-c;
}
}
ll qry(int r,int c){
ll res=0;
while(c){
res+=ft[r][c];
c-=c&-c;
}
return res;
}
int main(){
sf("%d",&n);
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
sf("%d",&a[i][j]);
ll dp=a[i][j]+max(qry(i-1,j),qry(i,j-1));
up(i,j,dp);
up(i,j+1,-dp);
s+=dp;
}
}
pf("%lld\n",s);
for(int i=0;i<n;++i){
sf(" %c",&t);
sf("%d%d",&x,&y);
int add;
if(t=='U')add=1;
else add=-1;
a[x][y]+=add;
int cl=y,cr=y;
for(int r=x;r<=n;++r){
while(cl<cr){
ll pv=qry(r,cl);
ll nw=a[r][cl]+max(qry(r,cl-1),qry(r-1,cl));
if(pv==nw)++cl;
else break;
}
up(r,cl,add);
while(cr<=n){
ll pv=qry(r,cr)-add;
ll nw=a[r][cr]+max(qry(r,cr-1),qry(r-1,cr));
if(pv!=nw)++cr;
else break;
}
//pf("%d %d %d\n",r,cl,cr);
up(r,cr,-add);
s+=(cr-cl)*add;
if(cr==cl)break;
}
/*
for(int r=1;r<=n;++r){
for(int c=1;c<=n;++c){
pf("%lld ",qry(r,c));
}
pf("\n");
}
*/
pf("%lld\n",s);
}
}
/*
3
3 1 1
1 1 1
1 1 1
U 2 1
U 1 2
U 1 2
*/
