#include <bits/stdc++.h>

#define endl            '\n'
#define pb             push_back
#define fill(x, y)     memset(x, y, sizeof(x))
#define all(x)         (x).begin(), (x).end()
#define debug(x)       { cerr << #x << " = " << x << endl; }
#define IO	       { ios_base::sync_with_stdio(false); cin.tie(0); }
#define read(x)	       freopen(x, "r", stdin)
#define write(x)       freopen(x, "w", stdout)

using namespace std;

typedef long long      ll;
typedef pair<int, int> ii;
typedef vector<int>    vi;

const double inf = 1e18;
const double pi = acos(-1);


const int MAX = 8e5 + 5;

int N = 4e5 + 1;
int tree[MAX*2];

//point update, range query
//initial elements at tree[n]....tree[2*n-1]
void build(){
    for(int i=N-1;i>=1;i--) 
        tree[i]=max(tree[i<<1],tree[i<<1|1]);
}

void update(int p,int value){
    for(tree[p+=N]=value; p>1; p>>=1)
        tree[p>>1]=max(tree[p],tree[p^1]);
}

//outputs max(l,r-1)
int query(int l,int r){
    int res=0;
    for(l+=N, r+=N; l<r; l>>=1, r>>=1) {
        if(l&1) res=max(res,tree[l++]);
        if(r&1) res=max(res,tree[--r]);
    }
    return res;
}


bool cmp(ii &a, ii &b) {
    if (a.first == b.first) return a.second > b.second;
    return a.first < b.first;
}

void solve() {
    int n;
    cin >> n;
    vector<ii> points;
    vi pts;
    map<ii, int> idx;
    for (int i=0; i<n; i++) {
        int a, t;
        cin >> a >> t;
        points.push_back({a, a+t-1});
        
        pts.push_back(a);
        pts.push_back(a + t - 1);
    }

    
    sort(all(pts));
    int cnt = 1;
    map<int, int> conv;
    conv[pts[0]] = cnt++;
    for (int i=1; i<pts.size(); i++) {
        if (pts[i] != pts[i-1]) conv[pts[i]] = cnt++;
    }

    for (int i=0; i<n; i++) {
        points[i].first = conv[points[i].first];
        points[i].second = conv[points[i].second];
        idx[points[i]] = i;
    }

    sort(all(points), cmp);

    //for (int i=N; i<2*N; i++) tree[i] = -1;
    build();

    vi ans(n);
    for (ii x: points) {
        int k = query(x.second + 1, N) + 1;
        ans[idx[x]] = k;
        int q = query(x.second + 1, x.second + 2);
        update(x.second + 1, max(q, k));
    }
    
    for (int i=0; i<n; i++) cout << ans[i] - 1 << " ";
    cout << endl;
}

int main() {
    IO;
    cout << fixed << setprecision(10);
    solve();
}