#include<bits/stdc++.h>

 #define pa pair<int,int>

 #define lowb(x) ((x)&(-(x)))

 #define REP(i,n0,n) for(i=n0;i<=n;i++)

 #define PER(i,n0,n) for(i=n;i>=n0;i--)

 #define MAX(a,b) ((a>b)?a:b)

 #define MIN(a,b) ((a<b)?a:b)

 #define CLR(a,x) memset(a,x,sizeof(a))

 #define rei register int

 using namespace std;

 typedef long long ll;

 const int maxn=;

 inline ll rd(){

     ll x=;char c=getchar();int neg=;

     while(c<''||c>''){if(c=='-') neg=-;c=getchar();}

     while(c>=''&&c<='') x=x*+c-'',c=getchar();

     return x*neg;

 }

 struct Node{

     int x,y,tp,id;

 }op[maxn];

 int N,M,rg[maxn],tmp[maxn];

 ll tr[maxn],ans[maxn];

 inline void add(int x,ll y){

     for(;x<=M;x+=lowb(x)) tr[x]+=y;

 }

 inline ll query(int x){

     ll re=;for(;x;x-=lowb(x)) re+=tr[x];return re;

 }

 inline bool cmp(int a,int b){

     return op[a].x<op[b].x;

 }

 void cdq(int l,int r){

     if(l>=r) return;

     // printf("!%d %d\n",l,r);

     int m=(l+r)>>;

     cdq(l,m);

     memcpy(tmp+l,rg+l,*(r-l+));

     sort(tmp+l,tmp+m+,cmp);sort(tmp+m+,tmp+r+,cmp);

     int p=l,q=m+;

     for(;q<=r&&op[tmp[q]].x<op[tmp[l]].x;q++);

     for(;q<=r;p++){

         // printf("%d %d\n",p,q);

         Node a=op[tmp[p]];

         if(a.tp==)

             add(a.y,);

         else if(a.tp==)

             add(a.y,ans[a.id]);

         for(int i=q;i<=r&&op[tmp[i]].x==a.x;i++){

             if(op[tmp[i]].y==a.y&&op[tmp[i]].tp==){

                 // printf("!!%d\n",tmp[i]);

                 if(a.tp==) ans[op[tmp[i]].id]++;

                 else if(a.tp==) ans[op[tmp[i]].id]+=ans[a.id];

             }

         }

         for(;q<=r&&(p==m||op[tmp[q]].x<op[tmp[p+]].x);q++){

             // printf("%d\n",q);

             if(op[tmp[q]].tp==){

                 ans[op[tmp[q]].id]+=query(op[tmp[q]].y);

             }

         }

     }

     p--;

     while(p>=l){

         Node a=op[tmp[p--]];

         if(a.tp==)

             add(a.y,-);

         else if(a.tp==)

             add(a.y,-ans[a.id]);

     }

     cdq(m+,r);

 }

 int main(){

     freopen("21.in","r",stdin);

     freopen("21.txt","w",stdout);

     rei i;

     N=rd();

     for(i=;i<=N;i++){

         char s[];

         scanf("%s",s);

         if(s[]=='Q') op[i].tp=;

         else if(s[]=='A') op[i].tp=;

         else op[i].tp=;

         op[i].x=rd(),op[i].y=rd(),op[i].id=i;

         M=max(M,op[i].y);

         rg[i]=i;

     }

     cdq(,N);

     for(i=;i<=N;i++) if(op[i].tp==) printf("%lld\n",ans[i]);

     return ;

 }