#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>

// AtCoder
// #include <atcoder/all>
// using namespace atcoder;

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
    #define eprintf(...)
#endif

#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair <ll,ll> P;
typedef long double ld;

template< typename Monoid >
struct SegmentTree {
    using F = function< Monoid(Monoid, Monoid) >;
    int sz;
    vector< Monoid > seg;
    const F f;
    const Monoid M1;
    SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
        sz = 1;
        while(sz < n) sz <<= 1;
        seg.assign(2 * sz, M1);
    }
    void set(int k, const Monoid &x) {
        seg[k + sz] = x;
    }
    void build() {
        for(int k = sz - 1; k > 0; k--) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    void update(int k, const Monoid &x) {
        k += sz;
        seg[k] = x;
        while(k >>= 1) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    Monoid query(int a, int b) {
        Monoid L = M1, R = M1;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) L = f(L, seg[a++]);
            if(b & 1) R = f(seg[--b], R);
        }
        return f(L, R);
    }
    Monoid operator[](const int &k) const {
        return seg[k + sz];
    }
    template< typename C >
    int find_subtree(int a, const C &check, Monoid &M, bool type) {
        while(a < sz) {
            Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
            if(check(nxt)) a = 2 * a + type;
            else M = nxt, a = 2 * a + 1 - type;
        }
        return a - sz;
    }
    template< typename C >
    int find_first(int a, const C &check) {
        Monoid L = M1;
        if(a <= 0) {
            if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
            return -1;
        }
        int b = sz;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) {
                Monoid nxt = f(L, seg[a]);
                if(check(nxt)) return find_subtree(a, check, L, false);
                L = nxt;
                ++a;
            }
        }
        return -1;
    }
    template< typename C >
    int find_last(int b, const C &check) {
        Monoid R = M1;
        if(b >= sz) {
            if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
            return -1;
        }
        int a = sz;
        for(b += sz; a < b; a >>= 1, b >>= 1) {
            if(b & 1) {
                Monoid nxt = f(seg[--b], R);
                if(check(nxt)) return find_subtree(b, check, R, true);
                R = nxt;
            }
        }
        return -1;
    }
};

struct UnionFind {
    vector< int > data;
    UnionFind(int sz) {
        data.assign(sz, -1);
    }
    bool unite(int x, int y) {
        // eprintf("unite %d-%d\n", x, y);
        x = find(x), y = find(y);
        if(x == y) return (false);
        if(data[x] > data[y]) swap(x, y);
        data[x] += data[y];
        data[y] = x;
        return (true);
    }
    int find(int k) {
        if(data[k] < 0) return (k);
        return (data[k] = find(data[k]));
    }    
    int size(int k) {
        return (-data[find(k)]);
    }
};

UnionFind uf(200001);

int main (void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<P> p(n);
    
    map<ll, ll> unzip_x, unzip_y;
    rep (i, n) {
        cin >> p[i].first >> p[i].second;
        unzip_x[p[i].first] = i;
    }

    // /*****/
    // rep (i, n) {
    //     rep (j, i + 1, n) {
    //         if (p[i].first < p[j].first ^ p[i].second > p[j].second) {
    //             uf.unite(i, j);
    //         }
    //     }
    // }
    // /*****/

    sort(all(p));
    rep (i, n) unzip_y[p[i].second] = i;

    SegmentTree<P> segl(n, [&](P a, P b) {
        if (a.second < b.second && b.second <= n) uf.unite(a.first, b.first);
        return a.second < b.second ? a : b;
    }, P{n, n + 1});
    SegmentTree<P> segr(n, [&](P a, P b) {
        if (a.second < b.second && b.second <= n) uf.unite(a.first, b.first);
        return a.second < b.second ? a : b;
        // return a.second < b.second ? b : a;
    }, P{n, n + 1});

    rep (i, n) {
        ll idx = unzip_y[i + 1]; // y ga i+1 no point no idx
        ll idx_old = unzip_x[p[idx].first]; // idx_old
        segl.update(idx, P{idx_old, i + 1}); // seg-tree ni toroku
        segl.query(0, idx + 1);
    }
    eprintf("\n");

    // rep (i, n) {
    //     ll idx = unzip_y[n - i]; // y ga i+1 no point no idx
    //     ll idx_old = unzip_x[p[idx].first]; // idx_old
    //     segr.update(idx, P{idx_old, n - i}); // seg-tree ni toroku
    //     segr.query(idx, n);
    // }
    reprev (i, n) {
        ll idx = unzip_y[i + 1]; // y ga i+1 no point no idx
        ll idx_old = unzip_x[p[idx].first]; // idx_old
        segr.update(idx, P{idx_old, i + 1}); // seg-tree ni toroku
        segr.query(idx, n);
    }

    rep (i, n) cout << uf.size(i) << "\n";

    /***************************************************/
    /* Submit this code from the browser if using ACL! */
    /***************************************************/
    return 0;
}

Measured memory_bytes: 48588