#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
vector<int>p1,p2;
int tag = 0;
int n;
int k[1000005],a[1000005],tree1[1000005],tree2[1000005];
void upd1(int pos,int add){
	assert(pos !=0);
    for(int i =pos;i<=n;i+=lowbit(i))tree1[i]+=add;return;
}void upd2(int pos,int add){
	//assert(pos!=0);
    for(int i =pos;i<=n;i+=lowbit(i))tree2[i]+=add;return;
}int query1(int pos){int res = 0;
    for(int i = pos;i>0;i-=lowbit(i))res+=tree1[i];return res;
}int query2(int pos){int res =0;
    for(int i = pos;i>0;i-=lowbit(i))res+=tree2[i];return res;
}inline int read(){
    int x =0,f = 1;char c = getchar();
    while(c<'0' or c>'9'){
    	if(c =='-')f=  -1;
		c = getchar();
	}
    while('0'<=c and c<='9'){
        x = x*10+(c^48),c = getchar();
    }return x*f;
}inline void write(int x){
    if(x<0)putchar('-'),x = -x;
    if(x>=10)write(x/10);
    putchar('0'+x%10);
}int pos1[1000005],pos2[1000005];
vector<int>q;
signed main(){
	//freopen("sth.out","w",stdout);
//	srand(time(0));
//	n = 1000000;
    n = read();
    for(int i = 1;i<=n;i++){
    	//k[i] = 1,a[i] = rand();
        k[i] = read(),a[i]= read();k[i]^=1;
    }//for(int i = 1;i<=n;i++)cout << k[i] << a[i];return 0;
	for(int i = 1;i<=n;i++){
        if(k[i]){
            tag++;
            p1.push_back(a[i]+tag),p2.push_back(a[i]);
        }
    }sort(p1.begin(),p1.end());p1.erase(unique(p1.begin(),p1.end()),p1.end());
    sort(p2.begin(),p2.end());p2.erase(unique(p2.begin(),p2.end()),p2.end());
    //return 0;
    //assert(p1.size()<=n),assert(p2.size()<=n);
    tag =0;q.push_back(0);
    for(int i = 1;i<=n;i++){
        if(k[i]){
            tag++;q.push_back(i);
         //   cout << 111 << endl;
            pos1[i] = n-(lower_bound(p1.begin(),p1.end(),a[i]+tag)-p1.begin());
            pos2[i] = n-(lower_bound(p2.begin(),p2.end(),a[i])-p2.begin());
            //cout << pos1[i] << " " << pos2[i] <<endl;
            int res = query2(pos2[i])-query1(pos1[i]-1);
            //cout << " " << query2(pos2[i]) << " " << query1(pos1[i]-1) << endl;
            write(res);putchar('\n');
            upd1(pos1[i],1),upd2(pos2[i],1);
        }else{
        	//cout << 111 << endl;
            upd1(pos1[q[a[i]]],-1),upd2(pos2[q[a[i]]],-1);
            //cout << 111 << endl;
        }
    }
    return 0;
}