#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128; 
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=1e6+5,m=1e6,inf=1e8;
int ls[N<<1],rs[N<<1],tot=1,ml[N<<1],mr[N<<1],n;
multiset<int> sl[N],sr[N];
map<pii,int> cnt;
struct node {pii a,b; int val;};
bool operator < (const node &a,const node &b) {
  return a.val>b.val;
}
priority_queue<node> q;

void build(int p,int l,int r) {
  ml[p]=-inf, mr[p]=inf; if(l==r) return; int mid=l+r>>1;
  build(ls[p]=++tot,l,mid), build(rs[p]=++tot,mid+1,r);
}
void mdfl(int p,int l,int r,int x,int y) {
  if(l==r) {
    if(!sl[l].size()) ml[p]=-inf;
    else ml[p]=*(--sl[l].end());
    return;
  } int mid=l+r>>1;
  if(x<=mid) mdfl(ls[p],l,mid,x,y);
  else mdfl(rs[p],mid+1,r,x,y);
  ml[p]=max(ml[ls[p]],ml[rs[p]]);
}
void mdfr(int p,int l,int r,int x,int y) {
  if(l==r) {
    if(!sr[l].size()) mr[p]=inf;
    else mr[p]=*sr[l].begin();
    return;
  } int mid=l+r>>1;
  if(y<=mid) mdfr(ls[p],l,mid,x,y);
  else mdfr(rs[p],mid+1,r,x,y);
  mr[p]=min(mr[ls[p]],mr[rs[p]]);
}
int qryl(int p,int l,int r,int x,int y) {
  if(x>y) return -inf;
  if(l==x&&r==y) return ml[p]; int mid=l+r>>1;
  if(y<=mid) return qryl(ls[p],l,mid,x,y);
  else if(x>mid) return qryl(rs[p],mid+1,r,x,y);
  else return max(qryl(ls[p],l,mid,x,mid),qryl(rs[p],mid+1,r,mid+1,y));
}
int qryr(int p,int l,int r,int x,int y) {
  if(x>y) return inf;
  if(l==x&&r==y) return mr[p]; int mid=l+r>>1;
  if(y<=mid) return qryr(ls[p],l,mid,x,y);
  else if(x>mid) return qryr(rs[p],mid+1,r,x,y);
  else return min(qryr(ls[p],l,mid,x,mid),qryr(rs[p],mid+1,r,mid+1,y));
}
void addl(int l,int r) {
  if(l<=0||r>m) return;
  int pl=qryl(1,1,m,1,l);
  if(pl!=-inf) {
    int pr=*sr[pl].begin();
    q.push((node){pii(pl,pr),pii(l,r),r-pl});
  }
}
void addr(int l,int r) {
  if(l<=0||r>m) return;
  int qr=qryr(1,1,m,r,m);
  if(qr!=inf) {
    int ql=*(--sl[qr].end());
    q.push((node){pii(l,r),pii(ql,qr),qr-l});
  }
}

signed main() {
  n=read(); build(1,1,m);
  rep(i,1,n) {
    static char s[3]; int l,r;
    scanf("%s%d%d",s,&l,&r);
    if(s[0]=='A') {
      sl[r].insert(l), sr[l].insert(r);
      cnt[pii(l,r)]++;
      addl(l,r), addr(l,r);
      mdfl(1,1,m,r,l);
      mdfr(1,1,m,r,l);
    } else {
      sl[r].erase(sl[r].find(l));
      sr[l].erase(sr[l].find(r));
      cnt[pii(l,r)]--;
      mdfl(1,1,m,r,l);
      mdfr(1,1,m,r,l);
      int pl=qryl(1,1,m,1,r);
      if(pl!=-inf) {
        int pr=*sr[pl].begin();
        addr(pl,pr);
      }
      int qr=qryr(1,1,m,l,m);
      if(qr!=inf) {
        int ql=*(--sl[qr].end());
        addl(ql,qr);
      }
    }
    while(!q.empty()) {
      auto [a,b,v]=q.top();
      if(cnt[a]&&cnt[b]) {
        printf("%d\n",v);
        break;
      } q.pop();
    }
    if(q.empty()) {
      int l=qryl(1,1,m,1,m), r=qryr(1,1,m,1,m);
      int al=*(--sl[r].end()), ar=*sr[l].begin();
      printf("%d\n",ar-al);
    }
  }
  return 0;
}