#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define el "\n"
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<ll, null_type,less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
const ll N = 4e5 + 10, INF = 1e18;
const ld pi = acos(-1);
const int mod = 1e9 + 7, LOG = 20;
const ld eps = 1e-4;
int dx[] = {0, -1, 0, 1, -1, 1, -1, 1};
int dy[] = { -1, 0, 1, 0, 1, -1, -1, 1};
ll n, m, k, x, y;
struct Node {
    int val;
} zero;
Node seg[N * 4];
int ans[N];
Node merge(Node a, Node b) {
    Node ans;
    ans.val = max(a.val , b.val);
    return ans;
}

void build(int idx, int l, int r) {
    if (l == r) {
        seg[idx].val = -1;
        return;
    }
    int mid = (l + r) / 2;
    build(idx * 2, l, mid);
    build(idx * 2 + 1, mid + 1, r);
    seg[idx] = merge(seg[idx * 2], seg[idx * 2 + 1]);
}

Node solve(int idx, int l, int r, int st, int en) {
    if (en < l || st > r) {
        Node tmp;
        tmp.val = -1;
        return tmp;
    }
    if (st >= l && en <= r) {
        return seg[idx];
    }
    int mid = (st + en) / 2;
    return merge(solve(idx * 2, l, r, st, mid), solve(idx * 2 + 1, l, r, mid + 1, en));
}

void update(int idx, int l, int r, int st, int en, int cur) {
    if (st > r || en < l) {
        return;
    }
    if (st >= l && en <= r) {
        //cout << cur << " " << seg[idx].val << el;
        seg[idx].val = max(cur, seg[idx].val);
        return;
    }
    int mid = (st + en) / 2;
    update(idx * 2, l, r, st, mid, cur);
    update(idx * 2 + 1, l, r, mid + 1, en, cur);
    seg[idx] = merge(seg[idx * 2], seg[idx * 2 + 1]);
}

void dowork() {
    zero.val = 0;
    cin >> n;
    map<int, int>id;
    set<int>st;
    vector<pair<pair<int, int>, int>> in;
    for (int i = 0; i < n; i++) {
        cin >> x >> y;
        st.insert(x);
        st.insert(x + y);
        in.push_back({{x, -(x + y)}, i});
    }
    sort(in.begin(), in.end());
    for (auto j : st) {
        id[j] = id.size() + 1;
    }
    for (auto j : in) {
        //cout << j.first.first << " " << -j.first.second << " " << id[j.first.first] << " " << id[-j.first.second] << el;;
    }
    build(1, 1, 2 * n);
    for (int i = 0; i < n; i++) {
        ans[in[i].second] = solve(1, id[-in[i].first.second], 2 * n, 1, 2 * n).val + 1;
       // cout << in[i].first.first << " " << -in[i].first.second << " " << in[i].second << " " << ans[in[i].second] << el;
        update(1, id[-in[i].first.second], id[-in[i].first.second], 1, 2 * n, ans[in[i].second]);
    }
    for (int i = 0; i < n; i++) {
        cout << ans[i] << " ";
    }
    cout << el;
}

signed main() {
    fast
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        dowork();
    }
    return 0;
}