//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#include "atcoder/convolution.hpp"
#include "atcoder/dsu.hpp"
#include "atcoder/fenwicktree.hpp"
#include "atcoder/lazysegtree.hpp"
#include "atcoder/math.hpp"
#include "atcoder/maxflow.hpp"
#include "atcoder/mincostflow.hpp"
#include "atcoder/modint.hpp"
#include "atcoder/scc.hpp"
#include "atcoder/segtree.hpp"
#include "atcoder/string.hpp"
#include "atcoder/twosat.hpp"

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
  
using namespace std;
using namespace atcoder;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 200000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

vector<int> g[N];
bool used[N];
vector<int> com;

void dfs(int u) {
    used[u] = true;
    com.push_back(u);
    for (int v : g[u]) {
        if (!used[v]) {
            dfs(v);
        }
    }
}

int main()
{
    //freopen("circus.in", "r", stdin);
    //freopen("circus.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n;
    cin >> n;
    vector<vector<int> > a(n);
    rep(i, 0, n) {
        int x, y;
        cin >> x >> y; x--; y--;
        a[i] = {x, y, i};
    }
    sort(a.begin(), a.end());
    vector<pair<int, int> > st;
    st.push_back({inf, -1});
    rep(i, 0, n) {
        int y = a[i][1];
        int my_id = a[i][2];
        while (st.back().fi < y) {
            int id = st.back().se;
            g[id].push_back(my_id);
            g[my_id].push_back(id);

            st.pop_back();
        }
        st.push_back({y, my_id});
    }

    st.clear();
    st.push_back({-inf, -1});
    repb(i, n - 1, -1) {
        int y = a[i][1];
        int my_id = a[i][2];
        while (st.back().fi > y) {
            int id = st.back().se;
            g[id].push_back(my_id);
            g[my_id].push_back(id);

            st.pop_back();
        }
        st.push_back({y, my_id});
    }

    rep(i, 0, n) {
        swap(a[i][0], a[i][1]);
    }

    sort(a.begin(), a.end());
    
    st.clear();
    st.push_back({inf, -1});
    rep(i, 0, n) {
        int y = a[i][1];
        int my_id = a[i][2];
        while (st.back().fi < y) {
            int id = st.back().se;
            g[id].push_back(my_id);
            g[my_id].push_back(id);

            st.pop_back();
        }
        st.push_back({y, my_id});
    }

    st.clear();
    st.push_back({-inf, -1});
    repb(i, n - 1, -1) {
        int y = a[i][1];
        int my_id = a[i][2];
        while (st.back().fi > y) {
            int id = st.back().se;
            g[id].push_back(my_id);
            g[my_id].push_back(id);

            st.pop_back();
        }
        st.push_back({y, my_id});
    }

    int ans[n];
    rep(i, 0, n) {
        if (!used[i]) {
            com.clear();
            dfs(i);
            for (int j : com) {
                ans[j] = sz(com);
            }
        }
    }
    rep(i, 0, n) {
        cout << ans[i] << "\n";
    }
    return 0;
}



Measured memory_bytes: 41756