#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define per(i,n) for(int i=n;i>=1;--i)
#define pb push_back
#define mp make_pair
#define N 210000
int n;
struct node
{
	int l,r,id;
	friend bool operator <(node x,node y)
	{
		if (x.l!=y.l)return x.l<y.l;
		return x.r>y.r;
	}
}a[2*N];
int ans[N];
int st[2*N];
void build(int t,int l,int r)
{
	st[t]=-1;
	if (l==r)return;
	int mid=(l+r)/2;
	build(2*t,l,mid);
	build(2*t+1,mid+1,r);
}
int getmax(int t,int l,int r,int a,int b)
{
	if (a<=l && r<=b)return st[t];
	int mid=(l+r)/2;
	int ret=-1;
	if (a<=mid)ret=max(ret,getmax(2*t,l,mid,a,b));
	if (b>mid)ret=max(ret,getmax(2*t+1,mid+1,r,a,b));
	return ret;
}
void insert(int t,int l,int r,int k,int p)
{
	if (l==r)
	{
		st[t]=max(st[t],p);
		return;
	}
	int mid=(l+r)/2;
	if (k<=mid)insert(2*t,l,mid,k,p);
	else insert(2*t+1,mid+1,r,k,p);
	st[t]=max(st[2*t],st[2*t+1]);
}
int main()
{
	cin>>n;
	static vector<int> save; save.clear();
	rep(i,n)
	{
		a[i].id=i;
		int x,y; scanf("%d%d",&x,&y);
		a[i].l=x; a[i].r=x+y; save.pb(a[i].l); save.pb(a[i].r);
	}
	sort(save.begin(),save.end());
	save.resize(unique(save.begin(),save.end())-save.begin());
	rep(i,n)a[i].l=lower_bound(save.begin(),save.end(),a[i].l)-save.begin()+1;
	rep(i,n)a[i].r=lower_bound(save.begin(),save.end(),a[i].r)-save.begin()+1;
	sort(a+1,a+n+1);
	int m=save.size();
	build(1,0,m);
	rep(i,n)
	{
		int f=getmax(1,0,m,a[i].r,m)+1;
		insert(1,0,m,a[i].r,f);
		
		//cout<<a[i].id<<" "<<a[i].l<<" "<<a[i].r<<" "<<f<<endl;
		ans[a[i].id]=f;
	}
	rep(i,n)printf("%d%c",ans[i],i==n?'\n':' ');
	return 0;
}