#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int q, n;
ll t, x, p;
vpll ql;
vl k;
sl s;
struct SegTree{
  typedef int T;
  T e = 0;
  T m(const T&a, const T&b){return a + b;}
//###################################################
  typedef int i;i n;vector<T> d;
  void init(i m){n=1<<(32-__builtin_clz(m-1));d.resize(2*n-1);FOR(j,0,2*n-1)d[j]=e;}
  void init(vector<T>&v){n=1<<(32-__builtin_clz(sz(v)-1));d.resize(2*n-1);FOR(j,0,sz(v))d[j+n-1]=v[j];FORR(k, n-2, 0)d[k]=m(d[k*2+1],d[k*2+2]);}
  void update(i k,T a){k+=n-1;d[k]=a;while(k>0){k=(k-1)/2;d[k]=m(d[k*2+1],d[k*2+2]);}}
  T q(i a,i b,i k,i l,i r){return (r<=a||b<=l)?e:(a<=l&&r<=b)?d[k]:m(q(a,b,k*2+1,l,(l+r)/2),q(a,b,k*2+2,(l+r)/2,r));}
  T query(i a,i b){return q(a,b,0,0,n);}
};
SegTree seg;
map<ll, int> m;

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> q;
  FOR(i, 0, q){
    cin >> t >> x;
    switch(t){
      case 1:
        s.insert(x - p);
        k.pb(x - p);
        break;
      case 2:
        break;
      case 3:
        p += x;
        break;
    }
    ql.pb(mp(t, x));
  }
  n = sz(s);
  seg.init(n);
  int idx = 0;
  each(itr, s){
    m[*itr] = idx;
    idx++;
  }
  p = 0;
  map<ll, int>::iterator itr;
  ll l, r, mid;
  FOR(i, 0, q){
    t = ql[i].fi;
    x = ql[i].se;
    switch(t){
      case 1:
        idx = m[x-p];
        seg.update(idx, seg.query(idx, idx+1) + 1);
        break;
      case 2:
        idx = m[k[x-1]];
        seg.update(idx, seg.query(idx, idx+1) - 1);
        break;
      case 3:
        p += x;
        break;
    }
    l = 0;
    r = q+1;
    while(r - l > 1){
      mid = (r + l) / 2;
      itr = m.lower_bound(mid-p);
      if(itr != m.end() && seg.query(itr->se, n) >= mid){
        l = mid;
      }else{
        r = mid;
      }
    }
    printf("%d\n",l);
  }
  return 0;
}