#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 9;
const int mod = 1e9 + 7;
#define eps 1e-5
#define inf 2e18
int n;
pair<int,int>  p[N];
struct Node
{
    int l,r,id;
    bool operator<(const Node&u)const
    {
        if(r!=u.r) return r>u.r;
        return l<u.l;
    }
}a[N];
int cnt[N];

void solve()
{
    cin>>n;
    for(int i=1;i<=n;++i) 
    {
        int x,y;cin>>x>>y;
        a[i].l=x,a[i].r=x+y,a[i].id=i;
    }

    sort(a+1,a+1+n);
    for(int i=1;i<=n;++i) p[i]={a[i].l,i};
    sort(p+1,p+1+n);


    int maxn=0;
    for(int i=1;i<=n;++i)
    {
        //if(a[i].l >= a[i-1].l && a[i].r <= a[i-1].r) cnt[a[i].id]=max(cnt[a[i].id],cnt[a[i-1].id]+1),maxn=max(maxn,cnt[a[i].id]);
        //else 
        if(a[i].r <= a[i-1].r)
        {
            int l = 1,r = n ,mid=0;
            while(l < r)
            {
                int mid = (l + r) / 2;
                if(p[mid].first > a[i].l) r = mid;
                else l=mid+1;
            }
            int pos = p[l].second;
            if(p[l].first > a[i].l) pos--;
            if( pos >= i) 
                cnt[a[i].id] = max({cnt[a[pos].id] , maxn + 1,cnt[a[i].id]}) , maxn=max(cnt[a[i].id],maxn);
            else
            {
                if(p[pos].first > a[i].l) pos--;
                if(a[pos].r >= a[i].r && pos) cnt[a[i].id]=max(cnt[a[i].id],cnt[pos]+1),maxn=max(cnt[a[i].id],maxn);
            }
        } 
    }
    for(int i=1;i<=n;++i) cout<<cnt[i]<<' ';

}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1; // cin>>_;
    while (_--) solve();
    return 0;
}