#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200005;
int n;
vector<pair<int,int> > nums;
int ans[N];
int maxl=0;
void solve(){
	cin>>n;
	for(int i=1,a,t;i<=n;i++){
		cin>>a>>t;
		nums.emplace_back(make_pair(a,t));
	}
	for(int i=1;i<n;i++){
		int p=0;
		for(int j=0;j<i;j++){
			if(nums[i].first<nums[j].first)continue;
			if(nums[i].first+nums[i].second<=nums[j].first+nums[j].second){
				p++;
			}
			if(p>maxl)break;
		}
		if(p>maxl)ans[i]=++maxl;
		else ans[i]=p;
	}
	for(int i=0;i<n;i++){
		if(i==0)cout<<ans[i];
		else cout<<" "<<ans[i];
	}
	return;
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int T_case=1;
	//cin>>T_case;
	while(T_case--){
		solve();
	}
    return 0;
}