#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
using H = pair<ll, ll>;
using P = pair<ll, H>;
using vi = vector<ll>;
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(ll i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) (lower_bound(all(b),(i))-(b).begin())
#define ssp(i,n) (i==(ll)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) for(int quetimes_=(n);quetimes_>0;quetimes_--)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
#define found(a,x) (a.find(x)!=a.end())
constexpr ll mod = (ll)1e9 + 7;
constexpr ll Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = (ll)3 * 1e18;
constexpr int Inf = (ll)15 * 1e8;
constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
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; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(short g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }
bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
template<typename T>
class csum {
    vec<T> v;
public:
    csum(vec<T>& a) :v(a) { build(); }
    csum() {}
    void init(vec<T>& a) { v = a; build(); }
    void build() {
        for (int i = 1; i < v.size(); i++) v[i] += v[i - 1];
    }
    //[l,r]
    T a(int l, int r) {
        if (r < l) return 0;
        return v[r] - (l == 0 ? 0 : v[l - 1]);
    }
    //[l,r)
    T b(int l, int r) {
        return a(l, r - 1);
    }
    T a(pair<int, int>t) {
        return a(t.first, t.second);
    }
    T b(pair<int, int>t) {
        return b(t.first, t.second);
    }
};
class mint {
public:ll v;
      mint(ll v = 0) { s(v % mod + mod); }
      constexpr static int mod = Mod;// (ll)1e9 + 7;
      constexpr static int fn_ = (ll)2e6 + 5;
      static mint fact[fn_], comp[fn_];
      mint pow(int x) const {
          mint b(v), c(1);
          while (x) {
              if (x & 1) c *= b;
              b *= b;
              x >>= 1;
          }
          return c;
      }
      inline mint& s(int vv) {
          v = vv < mod ? vv : vv - mod;
          return *this;
      }
      inline mint inv()const { return pow(mod - 2); }
      inline mint operator-()const { return mint() - *this; }
      inline mint& operator+=(const mint b) { return s(v + b.v); }
      inline mint& operator-=(const mint b) { return s(v + mod - b.v); }
      inline mint& operator*=(const mint b) { v = v * b.v % mod; return *this; }
      inline mint& operator/=(const mint b) { v = v * b.inv().v % mod; return *this; }
      inline mint operator+(const mint b) const { return mint(v) += b; }
      inline mint operator-(const mint b) const { return mint(v) -= b; }
      inline mint operator*(const mint b) const { return mint(v) *= b; }
      inline mint operator/(const mint b) const { return mint(v) /= b; }
      friend ostream& operator<<(ostream& os, const mint& m) {
          return os << m.v;
      }
      friend istream& operator>>(istream& is, mint& m) {
          int x; is >> x; m = mint(x);
          return is;
      }
      bool operator<(const mint& r)const { return v < r.v; }
      bool operator>(const mint& r)const { return v > r.v; }
      bool operator<=(const mint& r)const { return v <= r.v; }
      bool operator>=(const mint& r)const { return v >= r.v; }
      bool operator==(const mint& r)const { return v == r.v; }
      bool operator!=(const mint& r)const { return v != r.v; }
      explicit operator bool()const { return v; }
      explicit operator int()const { return v; }
      mint comb(mint k) {
          if (k > * this) return mint();
          if (!fact[0]) combinit();
          if (v >= fn_) {
              if (k > * this - k) k = *this - k;
              mint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
              return tmp * comp[k.v];
          }
          return fact[v] * comp[k.v] * comp[v - k.v];
      }//nCk
      mint perm(mint k) {
          if (k > * this) return mint();
          if (!fact[0]) combinit();
          if (v >= fn_) {
              mint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
              return tmp;
          }
          return fact[v] * comp[v - k.v];
      }//nPk
      static void combinit() {
          fact[0] = 1;
          for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * mint(i);
          comp[fn_ - 1] = fact[fn_ - 1].inv();
          for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * mint(i + 1);
      }
}; mint mint::fact[fn_], mint::comp[fn_];

//--------------------------------------------------------------
class unionfind {
    int size = 0;
    int pa[500000];
public:
    void init(int n) {
        size = n;
        for (int i = 0; i <= size; i++) pa[i] = -1;
    }
    int find(int x) {
        if (pa[x] < 0) return x;
        return pa[x] = find(pa[x]);
    }
    bool unite(int x, int y) {
        x = find(x); y = find(y);
        if (x == y) return false;
        if (pa[x] > pa[y]) swap(x, y);
        pa[x] += pa[y];
        pa[y] = x;
        return true;
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    bool isroot(int x) {
        return x == find(x);
    }
    int sz(int x) {
        return -pa[find(x)];
    }
    H operator[](int x) {
        x = find(x);
        return H{ x,-pa[x] };
    }
};
template<typename T>
class BIT {
    int size;
    vector<T>dat;
public:
    BIT() {}
    BIT(vector<T>v) {
        init(v);
    }
    BIT(int n) { init(n); }
    void init(int n) {
        size = n;
        dat.assign(size + 1, 0);
    }
    void init(vector<T>v) {
        init(v.size());
        for (int i = 1; i <= size; i++) {
            dat[i] += v[i - 1];
            if (i + (i & -i) <= size) dat[i + (i & -i)] += dat[i];
        }
    }
    void add(int i, ll x) {
        i++;
        while (i <= size) {
            dat[i] += x;
            i += i & -i;
        }
    }
    void change(int i, ll x) {
        i++; int t = x - dat[i];
        while (i <= size) {
            int k = dat[i];
            dat[i] += t;
            t = dat[i] - k;
            i += i & -i;
        }
    }
    //[l,r)
    void add(int l, int r, ll x) {
        add(l, x); add(r, -x);
    }
    //[0,i]
    T query(int i) {
        i++;
        T sum = 0;
        while (i > 0) {
            sum += dat[i];
            i -= i & -i;
        }
        return sum;
    }
    //[l,r)
    T query(int l, int r) {
        return query(r - 1) - query(l - 1);
    }
    //[0,x) >= w
    int lower_bound(T w) {
        if (w <= 0) return 0;
        int x = 0, k = 1;
        while (k * 2 < size) k *= 2;
        for (; k > 0; k /= 2) {
            if (x + k <= size && dat[x + k] < w) {
                w -= dat[x + k];
                x += k;
            }
        }
        return x;
    }
};//size, 0-indexed

//--------------------------------------------------------------
unionfind uf;
signed main() {
    int n; cin >> n;
    vec<H>a(n);
    rep(i, n) {
        a[i] = readh(1);
    }
    vi b(n);
    rep(i, n) b[i] = i;
    sort(all(b), [&](int i, int j) {
        return a[i] < a[j];
        });

    uf.init(n);
    int k = b[0];
    vi st = { a[b[0]].sc };
    vi v = { b[0] };
    vi sum(n + 1, 0);
    rng(iz, 1, n) {
        int i = b[iz];
        if (a[i].sc < a[k].sc) {
            st.pb(a[i].sc);
            v.pb(i);
            k = i;
        }
        else {
            uf.unite(i, k);
            if (siz(st) == 1) continue;
            int ok = siz(st) - 1, ng = -1, mid;
            while (ok-ng> 1) {
                mid = (ok + ng) / 2;
                if (st[mid] > a[i].sc) ng = mid;
                else ok = mid;
            }
            sum[max(0, ok)]++;
            sum[siz(st) - 1]--;
        }
    }
    rng(i, 1, n) sum[i] += sum[i - 1];
    rep(i, siz(v) - 1) {
        if (sum[i]) {
            uf.unite(v[i], v[i + 1]);
        }
    }

    rep(i, n) cout << uf[i].sc << endl;
}

Measured memory_bytes: 42116