#include <bits/stdc++.h>
using namespace std;
int cnt,  m, ls[2000006], lss[2000006], ct, ctt, l[1000006];
struct node {
	int op, p;
} b[1000006];
inline int finds(int p) {
	return lower_bound(ls + 1, ls + ct + 1, p) - ls;
}
inline int findss(int p) {
	return lower_bound(lss + 1, lss + ctt + 1, p) - lss;
}
inline int lowbit(int p) {
	return p & -p;
}
struct SGT {
	int t[2000006], n;
	inline void add(int p, int q) {
//		cout << p << "||" << q << "||" << n << endl;
		while (p <= n) {
			t[p] += q;
			p += lowbit(p);
		}
	}
	inline int query(int p) {
		int ans = 0;
		while (p >= 1) {
			ans += t[p];
			p -= lowbit(p);
		}
		return ans;
	}
} p, q;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin  >> m;
	for (int i = 1; i <= m; i++) {
		cin >> b[i].op >> b[i].p;
		if (b[i].op == 0) {
			lss[++cnt] = b[i].p + cnt;
			ls[2 * cnt - 1] = b[i].p;
			ls[2 * cnt] = b[i].p + 1;
		}
	}
	sort(ls + 1, ls + 2 * cnt + 1);
	sort(lss + 1, lss + cnt + 1);
	ls[0] = lss[0] = -1;
	for (int i = 1; i <= 2 * cnt; i++) {
		if (ls[i] != ls[i - 1]) {
			ls[++ct] = ls[i];
		}
	}
	for (int i = 1; i <= cnt; i++) {
		if (lss[i] != lss[i - 1]) {
			lss[++ctt] = lss[i];
		}
	}
	p.n = ct, q.n = ctt;
	cnt = 0;
	for (int i = 1; i <= m; i++) {
		if (b[i].op == 0) {
			cout << p.query(finds(b[i].p)) + q.query(findss(cnt + 1 + b[i].p)) << "\n";
			l[++cnt] = b[i].p;
			p.add(finds(b[i].p + 1), -1);
			q.add(findss(b[i].p + cnt), 1);
		} else {
			p.add(finds(l[b[i].p] + 1), 1);
			q.add(findss(b[i].p + l[b[i].p]), -1);
		}
	}
}