#include<bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int n, tr[maxn << 2], ans[maxn];
struct Val {
    int l, r, id;
    Val(int l = 0, int r = 0, int id = 0) : l(l), r(r), id(id) {}
    bool operator < (const Val &rhs) const {
        return l == rhs.l ? r > rhs.r : l < rhs.l;
    }
}val[maxn];
vector<int> v;
void Upd(int o, int l, int r, int p, int d) {
    if(l == r) {
        tr[o] = max(tr[o], d);
        return;
    }
    int mid = (l + r) >> 1;
    if(p <= mid)
        Upd(o << 1, l, mid, p, d);
    else
        Upd(o << 1 | 1, mid + 1, r, p, d);
    tr[o] = max(tr[o << 1], tr[o << 1 | 1]);
}
int Ask(int o, int l, int r, int ql, int qr) {
    if(ql <= l && r <= qr)
        return tr[o];
    int mid = (l + r) >> 1, ans = 0;
    if(ql <= mid)
        ans = max(ans, Ask(o << 1, l, mid, ql, qr));
    if(qr > mid)
        ans = max(ans, Ask(o << 1 | 1, mid + 1, r, ql, qr));
    return ans;
}
int main() {
    scanf("%d", &n);
    for(int i = 1, a, t; i <= n; ++ i) {
        scanf("%d%d", &a, &t);
        val[i] = Val(a, a + t, i);
        v.push_back(a);
        v.push_back(a + t);
    }
    sort(val + 1, val + n + 1);
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int sz = v.size();
    for(int i = 1; i <= n; ++ i) {
        val[i].l = lower_bound(v.begin(), v.end(), val[i].l) - v.begin() + 1;
        val[i].r = lower_bound(v.begin(), v.end(), val[i].r) - v.begin() + 1;
        ans[val[i].id] = Ask(1, 1, sz, val[i].r, sz) + 1;
        Upd(1, 1, sz, val[i].r, ans[val[i].id]);
    }
    for(int i = 1; i <= n; ++ i) {
        printf("%d ", ans[i] - 1);
    }
    puts("");
}