#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
//1-indexed
#include<vector>
template<typename T>
struct BIT{
	int n;
	vector<T>bit;
	BIT(int n_=0):n(n_),bit(n_+1){}
	T sum(int i)
	{
		T ans=0;
		for(;i>0;i-=i&-i)ans+=bit[i];
		return ans;
	}
	void add(int i,T a)
	{
		if(i==0)return;
		for(;i<=n;i+=i&-i)bit[i]+=a;
	}
	int lower_bound(T k)//k<=sum(ret)
	{
		if(k<=0)return 0;
		int ret=0,i=1;
		while((i<<1)<=n)i<<=1;
		for(;i;i>>=1)
			if(ret+i<=n&&bit[ret+i]<k)k-=bit[ret+=i];
		return ret+1;
	}
};
int Q;
int t[1<<17];
long x[1<<17];
main()
{
	cin>>Q;
	long cumsum=0;
	vector<long>X;
	for(int i=0;i<Q;i++)
	{
		cin>>t[i]>>x[i];
		if(t[i]==1)
		{
			x[i]-=cumsum;
			X.push_back(x[i]);
		}
		else if(t[i]==3)
		{
			cumsum+=x[i];
		}
	}
	sort(X.begin(),X.end());
	X.erase(unique(X.begin(),X.end()),X.end());
	BIT<int>P(X.size());
	vector<int>ind;
	cumsum=0;
	for(int i=0;i<Q;i++)
	{
		if(t[i]==1)
		{
			int id=lower_bound(X.begin(),X.end(),x[i])-X.begin()+1;
			P.add(id,1);
			ind.push_back(id);
		}
		else if(t[i]==2)
		{
			P.add(ind[x[i]-1],-1);
		}
		else
		{
			cumsum+=x[i];
		}
		long L=0,R=2e5;
		while(R-L>1)
		{
			long M=L+R>>1;
			long tst=M-cumsum;
			if(P.sum(X.size())-P.sum(lower_bound(X.begin(),X.end(),tst)-X.begin())>=M)L=M;
			else R=M;
		}
		cout<<L<<endl;
	}
}