#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, 0, 0, 1, -1, 1};
int dj[] = {0, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 1e9 + 7;
const int N = 4e5 + 5, M = 30005;
#define EPS 1e-9

int t, n, m, ans[N], tree[4 * N];
pair<pair<int, int>, int> a[N];

bool cmp(pair<pair<int, int>, int> one, pair<pair<int, int>, int> two) {
    if (one.first.first < two.first.first) return true;
    if (one.first.first > two.first.first) return false;
    if (one.first.second > two.first.second) return true;
    return false;
}

void update(int me, int l, int r, int idx, int val) {
    if (l == r) {
        tree[me] = max(tree[me], val);
        return;
    }
    int m = (l + r) >> 1;
    if (idx <= m) update(2 * me, l, m, idx, val);
    else update(2 * me + 1, m + 1, r, idx, val);
    tree[me] = max(tree[2 * me], tree[2 * me + 1]);
}

int mx(int me, int l, int r, int st, int en) {
    if (l > en || r < st) return 0;
    if (l >= st && r <= en) return tree[me];
    int m = (l + r) >> 1;
    return max(mx(2 * me, l, m, st, en), mx(2 * me + 1, m + 1, r, st, en));
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("output.txt", "w", stdout);
    cin >> n;
    map<int, int> mp, rev;
    int id = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].first.first >> a[i].first.second, a[i].second = i;
        mp[a[i].first.first] = mp[a[i].first.second] = 1;
    }
    sort(a + 1, a + n + 1, cmp);
    for (auto x:mp) rev[x.first] = ++id;
    for (int i = 1; i <= n; i++) {
        a[i].first.first = rev[a[i].first.first];
        a[i].first.second = rev[a[i].first.second];
    }
    for (int i = 1; i <= n; i++) {
        int tmp = mx(1, 1, n, a[i].first.second, N);
        ans[a[i].second] = tmp + 1;
        update(1, 1, n, a[i].first.second, tmp + 1);
    }
    for (int i = 1; i <= n; i++) cout << ans[i] - 1 << " ";
    return 0;
}