#include <bits/stdc++.h>
using namespace std;


const int N = 2e5 + 4;

int T[1 << 20] ;

int sz ;

void update(int x , int mx , int id = 0 , int tl = 0 ,int tr = sz-1)
{
    if(tl == tr)
    {
        T[id] = max(T[id] , mx) ;

        return;
    }

    int md = (tl + tr ) /2 ;

    if(x <= md) update(x , mx , 2*id + 1 ,tl , md) ;
    else update(x, mx ,2*id + 2, md+1 ,tr ) ;

    T[id] = max(T[2*id + 1] , T[2*id + 2]) ;
}

int get(int l , int r , int id =0 , int tl =0 , int tr = sz-1)
{
    if(l > tr || tl > r )return -1 ;
    if(l <= tl && tr <= r) return T[id] ;

    int md = (tl + tr)  / 2;
    return max(get(l ,r, 2*id +1 ,tl, md) , get(l ,r, 2*id + 2, md+1 ,tr ) ) ;
}

bool ch(pair< pair<int  , int> , int > & a , pair< pair<int  , int> , int > & b)
{
    if(a.first.first != b.first.first) return a.first.first < b.first.first ;

    return a.first.second > b.first.second ;
}

int ans[N] ;

int main() {
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    memset(T , -1 ,sizeof T) ;

    int n;
    cin >> n;

    vector< pair< pair<int  , int> , int > > v(n) ;

    vector<int> all ;

    for (int i = 0; i < n; ++i) {
        cin >> v[i].first.first >> v[i].first.second ;
        v[i].second = i;

        all.push_back(v[i].first.first + v[i].first.second - 1) ;
        all.push_back(v[i].first.first) ;
    }

    sort(all.begin() , all.end() ) ;

    all.erase(unique(all.begin() , all.end()) , all.end()) ;

    for (int i = 0; i < n; ++i) {
        v[i].first.first = lower_bound(all.begin() , all.end() , v[i].first.first) - all.begin() ;
        v[i].first.second = lower_bound(all.begin() , all.end() , v[i].first.second + v[i].first.first - 1) - all.begin() ;
    }

    sz = (int)all.size() + 4;

    sort(v.begin() , v.end() , ch) ;

    for (int i = 0; i < n; ++i) {
        ans[ v[i].second ] = 1 + get( v[i].first.second , sz-1) ;
        update(v[i].first.second , ans[v[i].second]) ;
    }

    for (int i = 0; i < n; ++i) {
        cout << ans[i] << " " ;
    }
}