#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), 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 (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

// par[i]  は，iがrootなら-(連結成分のサイズ)を，iがrootではないならばrootを返す
// root(x) は必ずroot を返す
struct UnionFindSize {
    vector<int> par;
    
    UnionFindSize(int n) : par(n, -1) { }
    void init(int n) { par.assign(n, -1); }
    
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }

    void print(){
        cout << "uf: ";
        for(int i=0;i<(int)par.size();i++) cout << root(i) << " ";
        cout << endl;
    }
};

int main(){

    ll N;
    cin >> N;
    V<pll> y(N);
    V<ll> idx(N);
    REP(i, N) cin >> y[i].first >> y[i].second;

    UnionFindSize uf(N);

    auto tsunagu = [&](V<pll> &x){
        iota(ALL(idx), 0);
        sort(ALL(idx), [&](ll i, ll j){
            return x[i] < x[j];
        });

        set<pll> st;
        REP(i, N){
            // dump(x[idx[i]])
            // dump(idx[i])
            if((int)st.size()!=0){
                auto itr = st.begin();
                // if(x[idx[i]].second>tmp.first){
                //     uf.merge(idx[i], tmp.second);
                // }
                while(x[idx[i]].second>(*itr).first){
                    // dump(idx[i])
                    // dump((*itr).second)
                    uf.merge(idx[i], (*itr).second);
                    itr = st.erase(itr);
                    if(st.empty()){
                        break;
                    }
                }
            }
            st.insert({x[idx[i]].second, idx[i]});
        }
    };

    tsunagu(y);
    REP(i, N) swap(y[i].first, y[i].second);
    tsunagu(y);
    REP(i, N){
        y[i].first *= -1;
        y[i].second *= -1;
    }
    tsunagu(y);
    REP(i, N) swap(y[i].first, y[i].second);
    tsunagu(y);

    V<ll> res(N);
    REP(i, N){
        res[i] = uf.size(i);
    }

    REP(i, N) cout << res[i] << "\n";

    return 0;
}

Measured memory_bytes: 14800