#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll,ll> P;
#define _for(x,y,z) for (int x(y),_(z); x<=_; ++x)
#define _rep(x,y,z) for (int x(y),_(z); x>=_; --x)
inline ll read(){ ll x; cin>>x; return x; }
inline void _init(){
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
}

const int N = 5005;
const int M = 5e5 + 5;

vector <int> tree[N << 2];

int n, l[N], r[N], k[N], ans[N];

stack <int> st[M];

inline void update(int i, int l, int r, int ql, int qr, int k) {
	if (ql <= l && r <= qr) {
		tree[i].emplace_back(k);
		return;
	}
	int mid = (l + r) >> 1;
	if (ql <= mid) {
		update(i << 1, l, mid, ql, qr, k);
	}
	if (qr > mid) {
		update(i << 1 | 1, mid + 1, r, ql, qr, k);
	}
}

inline void dfs(int i, int l, int r, bitset <M> b) {
	for (auto u: tree[i]) {
		b |= (b << u);
	}
	if (l == r) {
		ans[l] = b.count() - 1;
		return;
	}
	int mid = (l + r) >> 1;
	dfs(i << 1, l, mid, b);
	dfs(i << 1 | 1, mid + 1, r, b);
}

bitset <M> b;

void init() {}
void procedure() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		int op, val;
		cin >> op >> val;
		if (op == 1) {
			st[val].push(i);
			l[i] = i;
			r[i] = n;
			k[i] = val;
		} else {
			int u = st[val].top();
			st[val].pop();
			r[u] = i - 1;
		}
	}
	for (int i = 1; i <= n; ++i) {
		if (!k[i]) {
			continue;
		}
		update(1, 1, n, l[i], r[i], k[i]);
	}
	b[0] = 1;
	dfs(1, 1, n, b);
	for (int i = 1; i <= n; ++i) {
		cout << ans[i] << "\n";
	}
}

int main() {
	_init(), init();
	int T=1;
	while(T--) procedure();
	return 0;
}