#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int n, tot, head, tmpans, ans[5009], total[20009], opt[500009], cur;
int o, x, mx;

bitset <500009> dp;

struct Operation {
	int l, r, x;
} op[5009];

struct Op {
	int id, x;
};

queue <int> g[500009];

vector <Op> d[20009];

void add(int s, int t, int p, int l, int r, int c) {
	if (l <= s && t <= r) {
		d[p].push_back((Op) {l, c});
		return;
	}
	int mid = (s + t) / 2;
	if (l <= mid) add(s, mid, p * 2, l, r, c);
	if (r > mid) add(mid + 1, t, p * 2 + 1, l, r, c);
}

void insert(Op val) {
	int count = 0;
	for (int i = head + val.x; i >= val.x; --i) {
		if (!dp[i] && dp[i - val.x]) tmpans++, dp[i] = 1, count++, opt[++cur] = i;
	}
	head = head + val.x, total[val.id] = count;
}

void del(Op val) {
	for (int i = 1; i <= total[val.id]; ++i) {
		dp[opt[cur--]] = 0, tmpans--;
	}
	head = head - val.x;
}

void process(int s, int t, int p) {
	for (int i = 0; i < d[p].size(); ++i) insert(d[p][i]);
	if (s == t) {
		ans[s] = tmpans;
	}
	else {
		int mid = (s + t) / 2;
		process(s, mid, p * 2), process(mid + 1, t, p * 2 + 1);
	}
	for (int i = d[p].size() - 1; i >= 0; --i) {
		del(d[p][i]);
	}
}

int main() {
	scanf("%d", &n);
	dp[0] = 1;
	for (int i = 1; i <= n; ++i) {
		scanf("%d %d", &o, &x);
		mx = max(mx, x);
		if (o == 1) g[x].push(i);
		if (o == 2) {
			op[++tot] = (Operation) {g[x].front(), i - 1, x};
			g[x].pop();
		}
	}
	for (int i = 1; i <= mx; ++i)
		while (!g[i].empty()) {
			op[++tot] = (Operation) {g[i].front(), n, i};
			g[i].pop();
		}

	for (int i = 1; i <= tot; ++i) {
		add(1, n, 1, op[i].l, op[i].r, op[i].x);
	}

	process(1, n, 1);

	for (int i = 1; i <= n; ++i) {
		printf("%d\n", ans[i]);
	}
	return 0;
}