// Hey there.. I love you <3
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

mt19937 rnd(time(nullptr));

#define all(x) x.begin(), x.end()
#define f first
#define s second

const int N = 1 << 20, M = 705, mod = 1e9 + 7;

#define node int
const node defaultNode = 0;
node segTree[N << 1];
int segTreeSize = N;

node merge(node x, node y) { return max(x, y); }

void add(int i, node x) {
    i += segTreeSize;
    segTree[i] = max(segTree[i], x);
    while (i >>= 1) segTree[i] = merge(segTree[i << 1], segTree[(i << 1) + 1]);
}

node findSeg(int lo = 0, int ro = segTreeSize, int l = 0, int r = segTreeSize, int x = 1) {
    if (l >= ro || r <= lo) return defaultNode;
    if (l >= lo && r <= ro) return segTree[x];
    int mid = (l + r) >> 1;
    return merge(findSeg(lo, ro, l, mid, x << 1), findSeg(lo, ro, mid, r, (x << 1) + 1));
}

int n, ans[N];
pair<pair<int, int>, int> a[N];

void work() {
    
    cin >> n;
    
    map<int, int> mp;
    
    for (int i = 0; i < n; ++i) {
        cin >> a[i].f.f >> a[i].f.s;
        mp[a[i].f.f], mp[a[i].f.s];
    }
    
    int c = 0;
    for (auto &it: mp) it.s = c++;
    for (int i = 0; i < n; ++i)
        a[i] = {{mp[a[i].f.f], -mp[a[i].f.s]}, i};
    
    sort(a, a + n);
    for (int i = 0; i < n; ++i) {
        int r = -a[i].f.s;
        
        int score = findSeg(r) + 1;
        
        ans[a[i].s] = score;
        add(r, score);
    }
    
    for (int i = 0; i < n; ++i)
        cout << ans[i] - 1 << " ";
    cout << endl;
    
}


void init() {
    cin.tie(nullptr);
    istream::sync_with_stdio(false);
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    
    
}

int main() {
    init();
    
    int testCases = 1;
    //cin >> testCases;
    while (testCases--) work();
    
    return 0;
}