#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
#define PI acos(-1)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 2e5 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;

struct segTree {
    vector<set<pii>> seg;
    int sz = 1, n;

    segTree(int nn) {
        n = nn;
        while (sz < nn)
            sz *= 2;
        seg.resize(2 * sz);
    }

    void update(int l, int r, int v, int x, int lx, int rx) {
        bool add = false;
        while (true) {
            auto it = seg[x].upper_bound(make_pair(r, INF));
            if (it == seg[x].begin()) {
                add = true;
                break;
            }
            it--;
            if (v >= it->se) {
                add = true;
                seg[x].erase(it);
            } else break;
        }
        if (add) {
            auto it = seg[x].upper_bound(make_pair(r, INF));
            if (it == seg[x].end() || v > it->se)
                seg[x].insert({r, v});
        }
        if (lx == rx)return;
        int mid = (lx + rx) / 2, lf = 2 * x + 1, rt = 2 * x + 2;
        if (l <= mid)
            update(l, r, v, lf, lx, mid);
        else
            update(l, r, v, rt, mid + 1, rx);
    }

    void update(int l, int r, int v) {
        update(l, r, v, 0, 0, n - 1);
    }

    int query(int l, int r, int x, int lx, int rx) {
        if (rx <= l) {
            // answer
            auto it = seg[x].lower_bound(make_pair(r, -1));
            if (it == seg[x].end())return -1;
            return it->se;
        }
        if (lx > l)return -1;
        int mid = (lx + rx) / 2, lf = 2 * x + 1, rt = 2 * x + 2;
        return max(query(l, r, lf, lx, mid), query(l, r, rt, mid + 1, rx));
    }

    int query(int l, int r) {
        return query(l, r, 0, 0, n - 1);
    }
};


void solve() {
    int n;
    cin >> n;
    vector<pair<pii, int>> v(n);
    vector<int> vals;
    for (int i = 0; i < n; ++i) {
        cin >> v[i].fi.fi >> v[i].fi.se;
        v[i].fi.se += v[i].fi.fi;
        v[i].fi.fi--, v[i].fi.se--;
        vals.push_back(v[i].fi.fi);
        vals.push_back(v[i].fi.se);
        v[i].se = i;
    }
    sort(all(vals));
    vals.erase(unique(all(vals)), vals.end());
    for (int i = 0; i < n; ++i) {
        v[i].fi.fi = lower_bound(all(vals), v[i].fi.fi) - vals.begin();
        v[i].fi.se = lower_bound(all(vals), v[i].fi.se) - vals.begin();
    }
    sort(all(v), [&](pair<pii, int> &a, pair<pii, int> &b) {
        return (a.fi.se - a.fi.fi + 1) > (b.fi.se - b.fi.fi + 1);
    });
    vector<int> ans(n);
    segTree s(2 * n);
    for (int i = 0; i < n; ++i) {
        ans[v[i].se] = s.query(v[i].fi.fi, v[i].fi.se) + 1;
        s.update(v[i].fi.fi, v[i].fi.se, ans[v[i].se]);
    }
    for (int i = 0; i < n; ++i) {
        cout << ans[i] << ' ';
    }

}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}