#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;
    }
};

bool cmp(node a, node b)
{
    if (a.st != b.st)
    {
        return a.st < b.st;
    }
    return a.cnt > b.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(), cmp);
    for (int i = 0; i < n; i++)
    {
        v[i].idx = i;
    }
    vector<int> ans(n, 0);
    priority_queue<node> q;
    q.push(v[0]);
    while (q.size())
    {
        node cur = q.top();
        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)//无贡献
            {
                q.push(v[i]);
            }
            else
            {
                ans[v[i].id] = max(ans[cur.id] + 1, ans[v[i].id]);//比最高的高1int 
                int now = v[i].st;
                int l = i + 1, r = n - 1;//左端点大于等于
                int left = i + 1, right = n - 1;  
                while (l <= r)
                {
                    int mid = (l + r) >> 1;
                    if (v[l].st < now)
                    {
                        l = mid + 1;
                        left = l;
                    }
                    else
                    {
                        r = mid - 1;
                    }
                }
                now = v[i].st + v[i].cnt;
                while (l <= r)
                {
                    int mid = (l + r) >> 1;
                    if (v[l].st + v[l].cnt < now)
                    {
                        l = mid + 1;
                        right = l;
                    }
                    else
                    {
                        r = mid - 1;
                    }
                }
                if (left <= right)
                {
                    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;
}