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

int a[200001], b[200001], ans[200001];
map<int, int> unimp;
int seg[400001], N;
void update(int x, int v) {
 for(seg[x+=N]=v; x>1; x>>=1) seg[x/2] = max(seg[x], seg[x^1]);
}
int query(int x, int y) {
 int ret = -1;
 for (x+=N, y+=N+1; x<y; x>>=1, y>>=1) {
  if (x & 1) ret = max(ret, seg[x++]);
  if (y & 1) ret = max(ret, seg[--y]);
 }
 return ret;
}
int main() {
 ios::sync_with_stdio(0);
 cin.tie(0);
 int n;
 vector<int> uni;
 cin >> n;
 for (int i=0; i<n; i++) {
  cin >> a[i] >> b[i];
  b[i] += a[i];
  uni.push_back(a[i]);
  uni.push_back(b[i]);
 }
 sort(uni.begin(), uni.end());
 int ucnt = 0;
 for (int i=0; i<uni.size(); i++) {
  if (i && uni[i] != uni[i-1]) ucnt++;
  unimp[uni[i]] = ucnt;
 }
 N = ucnt + 1;
 vector<tuple<int,int,int>> vec;
 for (int i=0; i<n; i++) {
  a[i] = unimp[a[i]];
  b[i] = unimp[b[i]];
  vec.push_back({a[i], -b[i], i});
 }
 sort(vec.begin(), vec.end());
 for (int i=0; i<=N*2; i++) seg[i] = -1;
 for (int i=0; i<n; i++) {
  auto [s, e, ind] = vec[i];
  e = -e;
  ans[ind] = query(e, N - 1) + 1;
  update(e, ans[ind]);
 }
 for (int i=0; i<n; i++) cout << ans[i] << ' ';
}