#include<bits/stdc++.h>

using namespace std;

typedef __int128 ll;

const int MAXN = 5e5 + 10;

int Q, N, M, cnt;
ll now, f[MAXN], b[MAXN];
int tx[MAXN], ty[MAXN], a[MAXN];

void add(int x){ for (int i = M - 1 + x; i; i /= 2) a[i]++; }
void del(int x){ for (int i = M - 1 + x; i; i /= 2) a[i]--; }

int test(int L){
	int ret = 0, l = 1, r = M;
	if (b[1] + now >= L) return L <= a[1];
	for (int i = 1; l != r; ){
		int m = (l + r) / 2;
		if (b[m + 1] + now >= L){
			ret += a[i * 2 + 1];
			r = m, i = i * 2;
		}
		else{
			l = m + 1, i = i * 2 + 1;
		}
	}
	return ret >= L;
}

int main(){
	scanf("%d", &Q);
	map<ll, int> X;
	for (int i = 1; i <= Q; i++){
		scanf("%d%d", &ty[i], &tx[i]);
		if (ty[i] == 3)
			now += tx[i];
		if (ty[i] == 1){
			X[tx[i] - now] = 1;
			f[++cnt] = tx[i] - now;
		}
	}
	for (auto &x : X){
		x.second = ++N;
		b[N] = x.first;
	}
	for (M = 1; M < N; M *= 2);
	for (int i = N + 1; i <= M; i++)
		b[i] = b[N] + Q + 2;
	now = 0;
	int ans = 0;
	for (int i = 1; i <= Q; i++){
		if (ty[i] == 1){
			add(X[tx[i] - now]);
			ans += test(ans + 1);
		}
		else if (ty[i] == 2){
			del(X[f[tx[i]]]);
			ans -= (!test(ans));
		}
		else {
			now += tx[i];
			int L = 0, R = a[1] + 1;
			while (L + 1 < R){
				int Mid = (L + R) / 2;
				if (test(Mid))
					L = Mid;
				else
					R = Mid;
			}
			ans =L;
		}
		printf("%d\n", ans);
	}
	return 0;
}