#include<bits/stdc++.h>
#define lowbit(x) (x&(-x))
using namespace std;
int n;
struct query{
	int l,r,id,k;
	int ans;
	bool operator <(const query &o)const{
		return id<o.id;
	}
}q[1000005],b[1000005];
int tl[1000005],tr[1000005];
int tot=0,len;
int tmp[2000005];
int c[2000005];
void add(int x,int v){
//	printf("add %d %d\n",x,v);
	while(x<=len){
		c[x]+=v;
		x+=lowbit(x);
	}
}
int sum(int x){
	int ans=0;
	while(x){
		ans+=c[x];
		x-=lowbit(x);
	}
	return ans;
}
void cdq(int l,int r){
//	printf("cdq %d %d\n",l,r);
	if(l==r)return;
	int mid=(l+r)/2;
	cdq(l,mid);
	cdq(mid+1,r);
	int pos=l;
//	printf("cdq %d %d\n",l,r);
//	for(int i=l;i<=r;i++)printf("%d %d %d\n",q[i].l,q[i].r,q[i].k);
	for(int i=mid+1;i<=r;i++){
		while(pos<=mid && q[pos].l>=q[i].l){
			add(q[pos].r,q[pos].k);
			pos++;
		}
		q[i].ans+=sum(q[i].r);
//		printf("%d %d %d add %d\n",q[i].l,q[i].r,q[i].k,sum(q[i].r));
	}
	while(pos>l){
		pos--;
		add(q[pos].r,-q[pos].k);
	}
	int pl=l,pr=mid+1;
	for(int i=l;i<=r;i++){
		if(pl>mid)b[i]=q[pr++];
        else if(pr>r)b[i]=q[pl++];
        else if(q[pl].l>=q[pr].l)b[i]=q[pl++];
        else b[i]=q[pr++];
	}
	for(int i=l;i<=r;i++)q[i]=b[i];
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&q[i].k);
		if(q[i].k==0)q[i].k=1;
		else q[i].k=-1;
		q[i].id=i;
		q[i].ans=0;
		if(q[i].k==1){
			scanf("%d",&q[i].l);
			++tot;
			tl[tot]=q[i].l;
			tr[tot]=q[i].r=tl[tot]+tot-1;
		}
		else{
			int x;
			scanf("%d",&x);
			q[i].l=tl[x];
			q[i].r=tr[x];
		}
	}
	for(int i=1;i<=tot;i++)tmp[i+i-1]=tl[i],tmp[i+i]=tr[i];
	sort(tmp+1,tmp+tot+tot+1);
	len=unique(tmp+1,tmp+tot+tot+1)-tmp-1;
	for(int i=1;i<=n;i++)q[i].l=lower_bound(tmp+1,tmp+len+1,q[i].l)-tmp,q[i].r=lower_bound(tmp+1,tmp+len+1,q[i].r)-tmp;
	cdq(1,n);
	sort(q+1,q+n+1);
	for(int i=1;i<=n;i++)if(q[i].k==1)printf("%d\n",q[i].ans);
	return 0;
}