#include<bits/stdc++.h>
using namespace std;
int n;
typedef pair<int,int> pii;
map<int,int> mp;
int l[200005] , r[200005];
int ans[200005];
vector<pii> v[400005];
struct fenweick {
    int c[400005];
    fenweick() {
        memset(c,-1,sizeof(c)) ;
    }
    #define lowbit(x) (x&(-x)) ;
    void add(int u,int v) {
        while(u <= n) {
            c[u] = max(c[u] , v) ;
            u += lowbit(u) ;
        }
    }
    int qry(int u) {
        int ans = -1;
        while(u) {
            ans = max(ans , c[u]) ;
            u -= lowbit(u) ;
        }
        return ans;
    }
}fen;
int main()
{
   // freopen("in.txt","r",stdin);
    ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
    cin >> n;
    for(int i = 1;i <= n;i++) {
        int a , t;cin >> a >> t;
        l[i] = a;
        r[i] = a+t;
        mp[a] = 1;mp[a + t] = 1;
    }
    int cnt = 0;
    for(auto &[u,v] : mp) v = ++cnt ;
    for(int i = 1;i <= n;i++) {
        l[i] = mp[l[i]] ;
        r[i] = mp[r[i]] ;
        v[r[i]].push_back({l[i] , i}) ;
    }
    for(int i = cnt ; i >= 1;i--) {
        sort(v[i].begin() , v[i].end()) ;
        for(auto &[l , id] : v[i]) {
            ans[id] = fen.qry(l) + 1;
            fen.add(l , ans[id]) ;
        }
    }
    for(int i = 1;i <= n;i++) cout << ans[i] <<' ' ;
    return 0;
}