#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace __gnu_pbds; 
using namespace std;

#define int           long long 
#define S             second
#define F             first
#define pb            push_back
#define all(c)        (c).begin(),(c).end()
#define rall(c)       (c).rbegin(),(c).rend() 
#define lb            lower_bound
#define ub            upper_bound
#define si(c)         (int)((c).size())
#define lcm(a, b)      (a * (b / __gcd(a,b)))  
#define inf           (int)(4e18)
#define endl          '\n'
#define mp            make_pair
#define time(s)       (double(clock()-s)/double(CLOCKS_PER_SEC))
#define debug(args...)    _F(#args, args)
#define vi            std::vector<int>
#define pii           pair<int, int> 
#define vpi           vector<pii>
#define ordered_set   tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 

clock_t start;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

template<typename T> void _F(const char *name, T arg1){ cerr << name << " = " << arg1 << endl;}
template<typename T, typename... Args> void _F(const char *names, T arg1, Args... args)
{ const char *name = strchr(names, ',');cerr.write(names, name-names) << " = " << arg1 << endl;_F(name+2, args...);}

template< typename T1, typename T2 > istream& operator>>(istream& in, pair<T1, T2> &q){ in >> q.F >> q.S; return in;}
template< typename T1, typename T2 > ostream& operator<<(ostream& out, pair<T1, T2> &q){ out << q.F << " " << q.S; return out;}
template< typename T1, typename T2 > pair<T1, T2> operator+(pair<T1, T2> p1, pair<T1, T2> p2){ return {p1.F+p2.F, p1.S+p2.S};}
template< typename T1, typename T2 > pair<T1, T2> operator-(pair<T1, T2> p1, pair<T1, T2> p2){ return {p1.F-p2.F, p1.S-p2.S};}
template< typename T1, typename T2 > bool operator<(pair<T1, T2> p1, pair<T1, T2> p2){ return p1 < p2 ;}

template<typename T> void Unique(vector<T> &v) {
    sort(all(v)), v.resize(distance(v.begin(), unique(all(v))));
}

const int N = 2e5+1;

struct Dsu
{
	int par[N], siz[N];
	Dsu() {
		for(int i = 0; i < N; i++) {
			par[i] = i, siz[i] = 1;
		}
	}
	int root(int x) {
		return (x == par[x] ? x : (par[x]=root(par[x])));
	}
	void merge(int u, int v) {
		u = root(u), v = root(v);
		if(u == v) return;
		if(siz[v] > siz[u])swap(u, v);
		siz[u] += siz[v];
		par[v] = u;
	}
}ds;

void solve() {
	int n;
	cin >> n;

	std::vector<pair<pii, int > > v(n);
	for(int i = 0; i < n; i++) {
		cin >> v[i].F;
		v[i].S = i;
		
	}
	
	sort(all(v));
	stack<int> s;
	for(int i = 0; i < n; i++) {
		int mn = inf, id = -1;
		while(!s.empty() && v[s.top()].F.S < v[i].F.S) {
			ds.merge(v[i].S, v[s.top()].S);
			if(mn > v[s.top()].F.S)id = s.top();
			mn = min(mn, v[s.top()].F.S);
			s.pop();
		}
		if(mn > v[i].F.S)id = i;
		s.push(id);
	}

	for(int i = 0; i < n; i++) {
		cout << ds.siz[ds.root(i)] << endl;
	}
}

signed main(){

    ios_base::sync_with_stdio(0); 
    cin.tie(0); cout.tie(0);   
    start = clock(); 

   

    int test = 1;
    // cin >> test;
    
    cout << fixed << setprecision(2);
     
    for(int i = 1; i <= test; ++i){
    	solve();
    }

    cerr << time(start);
    return 0;
}


Measured memory_bytes: 11164