#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5;
const int INF = 1e9;

int n;
struct Seg {
	int l, r, id;
	Seg(){}
	Seg(int _l, int _r, int _id) {
		l = _l;
		r = _r;
		id = _id;
	}
} a[MAXN + 5];

int ans[MAXN + 5];

bool cmp(Seg x, Seg y) {
	if (x.l != y.l) {
		return x.l < y.l;
	} else {
		return x.r > y.r;
	}
}

int vals[MAXN * 2 + 5], cnt;

int c[MAXN * 2 + 5];
void modify(int p, int v) {
	for(; p; p -= (p & (-p))) {
		c[p] = max(c[p], v);
	}
}
int query(int p) { // suffix max
	int res = -INF;
	for (; p <= cnt; p += (p & (-p))) {
		res = max(res, c[p]);
	}
	return res;
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].l >> a[i].r;
		a[i].r += a[i].l; // the input is length; we need the right endpoint
		a[i].id = i;
		
		vals[++cnt] = a[i].l;
		vals[++cnt] = a[i].r;
	}
	
	sort(vals + 1, vals + cnt + 1);
	cnt = unique(vals + 1, vals + cnt + 1) - (vals + 1);
		
	for (int i = 1; i <= n; ++i) {
		a[i].l = lower_bound(vals + 1, vals + cnt + 1, a[i].l) - vals;
		a[i].r = lower_bound(vals + 1, vals + cnt + 1, a[i].r) - vals;
	}
	
	sort(a + 1, a + n + 1, cmp);
	
	for (int i = 1; i <= cnt; ++i) {
		c[i] = -INF;
	}
	
	for (int i = 1; i <= n; ++i) {
		ans[a[i].id] = max(0, query(a[i].r) + 1);
		modify(a[i].r, ans[a[i].id]);
	}
	
	for (int i = 1; i <= n; ++i) {
		cout << ans[i] << " \n"[i == n];
	}
	
	return 0;
}