#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
 
// hloya template v26
 
// ░░░░░░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░░░░░
// ░░░░░░█░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░█░░░░░
// ░░░░░░█░█░▀░░░░░▀░░▀░░░░█░█░░░░░
// ░░░░░░█░█░░░░░░░░▄▀▀▄░▀░█░█▄▀▀▄░
// █▀▀█▄░█░█░░▀░░░░░█░░░▀▄▄█▄▀░░░█░
// ▀▄▄░▀██░█▄░▀░░░▄▄▀░░░░░░░░░░░░▀▄
// ░░▀█▄▄█░█░░░░▄░░█░░░▄█░░░▄░▄█░░█
// ░░░░░▀█░▀▄▀░░░░░█░██░▄░░▄░░▄░███
// ░░░░░▄█▄░░▀▀▀▀▀▀▀▀▄░░▀▀▀▀▀▀▀░▄▀░
// ░░░░█░░▄█▀█▀▀█▀▀▀▀▀▀█▀▀█▀█▀▀█░░░
// ░░░░▀▀▀▀░░▀▀▀░░░░░░░░▀▀▀░░▀▀░░░░
 
#include <bits/stdc++.h>
using namespace std;
 
bool dbg = 0;
  
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
  
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define sqr(x) ((x) * (x))
 
#define ull unsigned long long
#define ll long long
#define ld long double
#define pii pair<int,int>
#define umap unordered_map<int, int>
 
#define files1 freopen("input.txt","r",stdin)
#define files2 freopen("output.txt","w",stdout)
#define files files1;files2
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0)
 
// #define endl '\n'
#define ln(i,n) " \n"[(i) == (n) - 1]
 
void bad(string mes = "NO"){cout << mes;exit(0);}
void bad(int mes){cout << mes;exit(0);}
 
template<typename T>
string bin(T x, int st = 2){
    string ans = "";
    while (x > 0){
        ans += char('0' + x % st);
        x /= st;
    }
    reverse(ans.begin(), ans.end());
    return ans.empty() ? "0" : ans;
}
 
mt19937_64 mt_rand(
    chrono::system_clock::now().time_since_epoch().count()
);
 
template<typename T1, typename T2> inline bool upmax(T1& a, T2 b) { return (a < b ? (a = b, true) : false); }
template<typename T1, typename T2> inline bool upmin(T1& a, T2 b) { return (b < a ? (a = b, true) : false); }
 
// inline int popcount(int x){
//     int count = 0;
//     __asm__ volatile("POPCNT %1, %0;":"=r"(count):"r"(x):);
//     return count;
// }
  
template<typename T>
T input(){
    T ans = 0, m = 1;
    char c = ' ';
  
    while (!((c >= '0' && c <= '9') || c == '-')) {
        c = getchar();
    }
  
    if (c == '-')
        m = -1, c = getchar();
    while (c >= '0' && c <= '9'){
        ans = ans * 10 + (c - '0'), c = getchar();
    }
    return ans * m;
}
 
template<typename T>
T gcd (T a, T b) { while (b) { a %= b; swap (a, b); } return a; }
  
template<typename T> void read(T& a) { a = input<T>(); }
template<typename T> void read(T& a, T& b) { read(a), read(b); }
template<typename T> void read(T& a, T& b, T& c) { read(a, b), read(c); }
template<typename T> void read(T& a, T& b, T& c, T& d) { read(a, b), read(c, d); }
 
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)3e5 + 3, base = 998244353;
const ll llinf = 2e18 + 5;
const int mod = 200003;

int binpow (int a, int n) {
    int res = 1;
    while (n) {
        if (n & 1)
            res = 1ll * res * a % mod;
        a = 1ll * a * a % mod;
        n >>= 1;
    }
    return res;
}

// ll solve(ll n) {
//     for (ll p = 1; p <= (ll)8e7; p++) {
//         __int128 a = (__int128)2 * p * n;
//         ll x = (sqrt(4 * a + 1) - 1) / 2;

//         if ((__int128)x * (x + 1) / 2 % n == 0) {
//             return x;
//         }
//     }
//     throw;
// }

#include <atcoder/dsu>





int x[maxn], y[maxn];

int main() {
    // files1;
    fast_io;

    int n;
    cin >> n;

    vector<int> ordx, ordy;
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
        ordx.push_back(i);
        ordy.push_back(i);
    }

    atcoder::dsu d(n);

    sort(all(ordx), [&](int i, int j){
        return x[i] < x[j];
    });

    sort(all(ordy), [&](int i, int j){
        return y[i] < y[j];
    });

    vector<pair<int, int>> smax(n), pmin(n);
    for (int i = 0; i < n; i++) {
        pmin[i] = {x[ordy[i]], ordy[i]};
        if (i > 0) {
            pmin[i] = min(pmin[i], pmin[i - 1]);
        }
    }

    for (int i = n - 1; i >= 0; i--) {
        smax[i] = {x[ordy[i]], ordy[i]};
        if (i + 1 < n) {
            smax[i] = max(smax[i], smax[i + 1]);
        }
    }

    for (int i = 0; i < n; i++) {
        int id = ordy[i];
        int to = pmin[i].second;

        if (x[to] < x[id]) {
            d.merge(id, to);
        }

        to = smax[i].second;
        if (x[to] > x[id]) {
            d.merge(id, to);
        }
    }

    for (int i = 0; i < n; i++) {
        pmin[i] = {y[ordx[i]], ordx[i]};

        if (i > 0) {
            pmin[i] = min(pmin[i], pmin[i - 1]);
        }
    }

    for (int i = n - 1; i >= 0; i--) {
        smax[i] = {y[ordx[i]], ordx[i]};
        if (i + 1 < n) {
            smax[i] = max(smax[i], smax[i + 1]);
        }
    }


    for (int i = 0; i < n; i++) {
        int id = ordx[i];
        int to = pmin[i].second;

        if (y[to] < y[id]) {
            d.merge(id, to);
        }

        to = smax[i].second;
        if (y[to] > y[id]) {
            d.merge(id, to);
        }
    }

    for (int i = 0; i < n; i++) {
        cout << d.size(i) << "\n";
    }
    // cout << solve((ll)1e15);
    return 0;
}

Measured memory_bytes: 10408