#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<stack>
#include<iomanip>
#include<cmath>
using namespace std;
using ll = long long;
#define int ll
typedef pair<int, int> pii;

struct node
{
    int id, st, cnt, idx;
    bool operator<(const node& a) const 
    {
        if (st != a.st)
        {
            return st < a.st;
        }
        return cnt > a.cnt;
    }
};


void solve()
{
    int n;
    cin >> n;
    vector<node> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i].st >> v[i].cnt;
        v[i].id = i;
    }
    sort(v.begin(), v.end());
    for (int i = 0; i < n; i++)
    {
        v[i].idx = i;
    }
    vector<int> ans(n, 0);
    ////////
    //for (int i = 0; i < n; i++)
    //{
    //    for (int j = i + 1; j < n; j++)
    //    {
    //        if (v[i].st <= v[j].st && v[i].st + v[i].cnt >= v[j].st + v[j].cnt)
    //        {
    //            ans[v[i].id] = max(ans[v[i].id] + 1, ans[v[i].id]);
    //        }
    //    }
    //}
    ///////
    vector<bool> inque(n, false);
    priority_queue<node> q;
    q.push(v[0]);
    inque[v[0].id] = true;
    while (q.size())
    {
        node cur = q.top();
        inque[cur.id] = false;
        q.pop();
        for (int i = cur.idx + 1; i < n; i++)//遍历之后的人
        {
            if (cur.st <= v[i].st && cur.st + cur.cnt >= v[i].st + v[i].cnt)//有贡献
            {
                ans[v[i].id] = max(ans[cur.id] + 1, ans[v[i].id]);
            }
            if (!inque[cur.id])//不在队里且还有贡献
            {
                q.push(v[i]);
                inque[cur.id] = true;
            }
        }
       /* int l = cur.idx + 1, r = n - 1;
        int left = cur.idx + 1, right = n - 1;
        while (l <= r)
        {
            int mid = (l + r) >> 1;
            if (v[l].st > mid)
            {
                l = mid + 1;
                left = l;
            }
            else
            {
                r = mid - 1;
            }
        }*/
        //l = left, r = n - 1;
        //while (l <= r)
        //{
        //    int mid = (l + r) >> 1;
        //    if (v[l].st + v[l].cnt < mid)
        //    {
        //        l = mid + 1;
        //        right = l;
        //    }
        //    else
        //    {
        //        r = mid - 1;
        //    }
        //}
        //for (int i = left; i < n; i++)//遍历之后的人
        //{
        //    if (cur.st <= v[i].st && cur.st + cur.cnt >= v[i].st + v[i].cnt)//有贡献
        //    {
        //        ans[v[i].id] = max(ans[cur.id] + 1, ans[v[i].id]);
        //    }
        //    if (!inque[cur.id])//不在队里且还有贡献
        //    {
        //        q.push(v[i]);
        //    }
        //}
    }
    for (int i = 0; i < n; i++)
    {
        cout << ans[i] << " ";
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}