#include<cstring>
#include<algorithm>
using namespace std;
pair<int, int>re[100009];
int q, k, b,t[210000], n,sum;
int main() {
	 scanf("%d", &n);
	memset(re,0x3f,sizeof re);
	for (int i = 0; i < n; i++) {
		scanf("%d %d %d", &q, &k, &b);
		if (q == 1) {
			sum++;
			t[k + 100005]++;
			re[i] = { k,b };
		}
		else if (q == 2) {
		printf("%d \n",sum-t[k+100005]);
		}
		else {
			for (int ii = 0; ii <n; ii++) {
				if ((re[ii].first == k && re[ii].second == b)|| (re[ii].first != k && re[ii].first < 1e6)) {
					t[re[ii].first + 100005]--;
					re[ii].first = 1e7;
					re[ii].second = 1e7;
					sum--;
				}
			}
		}
	}
	return 0;
}```