#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
#define int long long
using namespace std;
inline int read() {
    int x = 0; bool op = 0;
    char c = getchar();
    while(!isdigit(c))op |= (c == '-'), c = getchar();
    while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return op ? -x : x;
}
const int N = 2.5e5 + 10;
const int INF = 1e18;
int n;
struct Node {
    int id, l, r;
    Node() {}
    Node(int id, int l, int r):id(id), l(l), r(r) {}
    bool operator < (const Node &tmp) const {return (r != tmp.r ? r < tmp.r : (l != tmp.l ? l > tmp.l : id < tmp.id));}
}a[N];
int tot, lsh[N << 1];
void disc() {
    for(int i = 1; i <= n; i++)lsh[++tot] = a[i].l, lsh[++tot] = a[i].r;
    sort(lsh + 1, lsh + 1 + tot);
    tot = unique(lsh + 1, lsh + 1 + tot) - (lsh + 1);
    for(int i = 1; i <= n; i++) {
        a[i].l = lower_bound(lsh + 1, lsh + 1 + tot, a[i].l) - lsh;
        a[i].r = lower_bound(lsh + 1, lsh + 1 + tot, a[i].r) - lsh;
    }
    return ;
}
struct BIT {
    int sum[N];
    void update(int x, int w) {for(int i = x; i <= tot; sum[i] += w, i += (i & -i));}
    int query(int x) {int res = 0; for(int i = x; i; res += sum[i], i -= (i & -i)); return res;}
}T;
int f1[N << 1], f2[N];
int f1_nxt(int x) {return f1[x] == x ? x : f1[x] = f1_nxt(f1[x]);}
int f2_nxt(int x) {return f2[x] == x ? x : f2[x] = f2_nxt(f2[x]);}
struct Tree {
    int mn, pos, tg;
}nd[N << 2];
void mark(int k, int w) {nd[k].mn += w; nd[k].tg += w;}
void pushdown(int k) {
    if(nd[k].tg == 0)return ;
    mark(k << 1, nd[k].tg); mark(k << 1 | 1, nd[k].tg);
    nd[k].tg = 0;
    return ;
}
void pushup(int k) {
    Tree ls = nd[k << 1], rs = nd[k << 1 | 1];
    if((ls.mn < rs.mn) || (ls.mn == rs.mn && a[ls.pos].id < a[rs.pos].id))nd[k].mn = ls.mn, nd[k].pos = ls.pos;
    else nd[k].mn = rs.mn, nd[k].pos = rs.pos;
    return ;
}
void build(int k, int l, int r) {
    if(l == r)return nd[k].mn = INF, nd[k].pos = l, void();
    int mid = l + r >> 1;
    build(k << 1, l, mid); build(k << 1 | 1, mid + 1, r);
    pushup(k);
    return ;
}
void update(int k, int l, int r, int x, int w) {
    if(l == r)return nd[k].mn = w, void();
    int mid = l + r >> 1; pushdown(k);
    if(x <= mid)update(k << 1, l, mid, x, w);
    else update(k << 1 | 1, mid + 1, r, x, w);
    pushup(k);
    // printf("update:%d %d %d %lld %d\n", l, r, x, nd[k].mn, nd[k].pos);
    return ;
}
void add(int k, int l, int r, int qx, int qy, int w) {
    if(l >= qx && r <= qy)return mark(k, w), void();
    int mid = l + r >> 1; pushdown(k);
    if(qx <= mid)add(k << 1, l, mid, qx, qy, w);
    if(qy > mid)add(k << 1 | 1, mid + 1, r, qx, qy, w);
    pushup(k);
    return ;
}
signed main() { 
    n = read();
    for(int i = 1; i <= n; i++) {
        int l = read(), r = read(); 
        a[i] = Node(i, l, r);
    }
    disc(); sort(a + 1, a + 1 + n);
    build(1, 1, n);
    for(int i = 1; i <= tot; i++)T.update(i, lsh[i] - lsh[i - 1]);
    for(int i = 1; i <= tot + 1; i++)f1[i] = i;
    for(int i = 1; i <= n + 1; i++)f2[i] = i;
    set<pii> s1, s2;
    for(int i = 1, mx = 0; i <= n; i++) {
        if(mx < a[i].l) {
            update(1, 1, n, i, lsh[a[i].r] - lsh[a[i].l]);
            mx = a[i].l; f2[i] = f2_nxt(i + 1);
            s1.insert(mp(a[i].l, i)); s2.insert(mp(a[i].r, i));
            // cout << "init:" << i << ' ' << a[i].id << endl;
        }
    }
    vector<int> ans;
    while(ans.size() < n) {
        int pos = nd[1].pos; ans.pb(a[pos].id); 
        update(1, 1, n, pos, INF);
        // cerr << a[pos].id << endl;
        // cout << "pos:" << nd[1].pos << ' ' << nd[1].mn << endl;
        for(int i = a[pos].l + 1; i <= a[pos].r; i = f1_nxt(i + 1)) {
            T.update(i, -(lsh[i] - lsh[i - 1])); f1[i] = f1_nxt(i + 1);
            int l = (*s2.lower_bound(mp(i, 0))).SE, r = (*(--s1.upper_bound(mp(i - 1, INF)))).SE;
            // cout << i << ' ' << l << ' ' << r << endl;
            if(l <= r)add(1, 1, n, l, r, -(lsh[i] - lsh[i - 1]));
        }
        // cerr << pos << endl;
        s1.erase(mp(a[pos].l, pos)); s2.erase(mp(a[pos].r, pos));
        for(int i = f2_nxt(pos), mx = 0; i <= n; i = f2_nxt(i + 1)) {
            if(a[i].l <= mx || a[i].l > a[pos].l)break;
            auto now = s1.lower_bound(mp(a[i].l, 0));
            // cerr << "preins:" << i << ' ' << now << endl;
            // cerr << "ins:" << i << endl;
            if(now != s1.end() && a[(*now).SE].r <= a[i].r)break;
            s1.insert(mp(a[i].l, i)); s2.insert(mp(a[i].r, i)); f2[i] = f2_nxt(i + 1);
            update(1, 1, n, i, T.query(a[i].r) - T.query(a[i].l)); mx = a[i].l;
        }
    }
    for(int t : ans)printf("%lld ", t);
    return 0;
}