#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int N = 1e6 + 5, oo = 1e9;
multiset < int > ms[2][N];
int tree[4 * N];
void update(int l, int r, int x, int val, int p) {
if(l > x || r < x) return;
if(l == r) {
tree[p] = val;
} else {
int m = l + r >> 1;
update(l, m, x, val, p << 1);
update(m + 1, r, x, val, p << 1 | 1);
tree[p] = min(tree[p << 1], tree[p << 1 | 1]);
}
}
int query(int l, int r, int L, int R, int p) {
if(L > r || l > R) return oo;
if(L <= l && R >= r) return tree[p];
int m = l + r >> 1;
return min(query(l, m, L, R, p << 1), query(m + 1, r, L, R, p << 1 | 1));
}
int main() {
for(int i = 0; i < 4 * N; ++i) tree[i] = oo;
int q;
cin >> q;
multiset < pair < int, int > > m;
for(int i = 1; i <= q; ++i) {
int l, r;
char t;
cin >> t >> l >> r;
if(t == 'R') {
m.erase(m.find({l, r}));
ms[0][l].erase(ms[0][l].find(r));
ms[1][r].erase(ms[1][r].find(l));
int val = oo;
if(!ms[0][l].empty()) {
val = *ms[0][l].begin();
}
update(1, N - 1, l, val, 1);
} else {
m.insert({l, r});
ms[0][l].insert(r);
ms[1][r].insert(l);
update(1, N - 1, l, *ms[0][l].begin(), 1);
}
int maxL = -1, minR = 1e9;
for(auto [l, r] : m) {
maxL = max(maxL, l);
minR = min(minR, r);
}
if(minR <= maxL) {
int best = 1e9;
for(auto [l, r] : m) {
best = min(best, query(1, N - 1, r, N - 1, 1) - l);
}
cout << best << '\n';
} else {
int ansL = -1, ansR = 1e9;
ansR = *ms[0][maxL].begin();
ansL = *ms[1][minR].rbegin();
// for(auto [l, r] : m) {
// if(l == maxL) {
// ansR = min(ansR, r);
// }
// if(r == minR) {
// ansL = max(ansL, l);
// }
// }
cout << ansR - ansL << '\n';
}
}
}
