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

using namespace __gnu_pbds;
using namespace std;

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
const int N = 2e5 + 5, MOD = 998244353;
const ld PI = acos(-1);
char grid[705][705];
int h, w;

vector<pair<int, int>> v;
bool cmp(int i, int j) {
    if (v[i].first == v[j].first)
        return v[i].second > v[j].second;
    return v[i].first < v[j].first;
}

void doWork() {
    int n;

    cin >> n;

    v.resize(n);
    vector<int> ans(n);
    vector<int> ind(n);
    iota(ind.begin(), ind.end(), 0);

    ordered_multiset<int>st;

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

    sort(ind.begin(), ind.end(), cmp);

    for(int i=0;i<n;i++)
    {
        ans[ind[i]] = (int)st.size() - st.order_of_key(v[ind[i]].second-1);
        st.insert(v[ind[i]].second);

        if(st.order_of_key(v[ind[i]].second) > 0)
        {
            auto it = st.upper_bound(v[ind[i]].second);
            it--;
            st.erase(it);
        }

//        for(auto j : st)
//            cout<<j<<' ';
//        cout<<endl;
    }

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

int main() {
    IO
    int T = 1;
    //cin >> T;
    while (T--) {
        doWork();
    }
}