#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
// copium

struct bit {
  int bit[1 << 18];
  void update(int i, int val) {
    i++;
    while(i <= (1 << 18)) {
      bit[i] += val;
      i += i & (-i);
    }
  }
  int query(int i) {
    i++;
    int sum = 0;
    while(i > 0) {
      sum += bit[i];
      i -= i & (-i);
    }
    return sum;
  }
  int query(int l, int r) {
    if(l == 0) return query(r);
    return query(r) - query(l - 1);
  }
} sum;
const int N = 1 << 18;
pair<pair<int, int>, int> arr[250001];
struct seg {
  pair<int, int> seg[N << 1];
  int lazy[N << 1];
  void kms(int i, int val) {
    seg[i].f += val, lazy[i] += val;
  }
  void push(int i) {
    if(lazy[i]) {
      kms(2 * i, lazy[i]), kms(2 * i + 1, lazy[i]);
      lazy[i] = 0;
    }
  }
  void init(int i = 1, int l1 = 0, int r1 = N - 1) {
    lazy[i] = 0;
    if(l1 == r1) {
      seg[i] = mp(2e9, 0);
      return;
    }
    int mid = (l1 + r1) / 2;
    init(2 * i, l1, mid);
    init(2 * i + 1, mid + 1, r1);
    pull(i);
  }
  void pull(int i) {
    if(seg[2 * i].f == seg[2 * i + 1].f) {
      if(arr[seg[2 * i].s].s < arr[seg[2 * i + 1].s].s) seg[i] = seg[2 * i];
      else seg[i] = seg[2 * i + 1];
    } else seg[i] = min(seg[2 * i], seg[2 * i + 1]);
  }
  void upd(int i, pair<int, int> val, int i1 = 1, int l1 = 0, int r1 = N - 1) {
    if(l1 > i || r1 < i) return;
    if(i == l1 && i == r1) {
      seg[i1] = val;
      return;
    }
    int mid = (l1 + r1) / 2;
    push(i1);
    upd(i, val, 2 * i1, l1, mid);
    upd(i, val, 2 * i1 + 1, mid + 1, r1);
    pull(i1);
  }
  void inc(int l, int r, int val, int i = 1, int l1 = 0, int r1 = N - 1) {
    if(l1 > r || r1 < l) return;
    if(l <= l1 && r1 <= r) {
      kms(i, val);
      return;
    }
    push(i);
    int mid = (l1 + r1) / 2;
    inc(l, r, val, 2 * i, l1, mid);
    inc(l, r, val, 2 * i + 1, mid + 1, r1);
    pull(i);
  }
  pair<int, int> query(int l, int r, int i = 1, int l1 = 0, int r1 = N - 1) {
    if(l1 > r || r1 < l) return mp(2e9, 2e9);
    if(l <= l1 && r1 <= r) return seg[i];
    push(i);
    int mid = (l1 + r1) / 2;
    return min(query(l, r, 2 * i, l1, mid), query(l, r, 2 * i + 1, mid + 1, r1));
  }
} seg1, seg2;
int n;
int wxzs[500001];
set<pair<int, int>> s;
set<int> bk;
void add(int i) {
  seg1.upd(i, mp(sum.query(arr[i].f.f, arr[i].f.s - 1), i));
  s.insert(mp(arr[i].f.s, i));
}
void del(int l, int r) {
  auto it = bk.lower_bound(l);
  while(it != bk.end() && *it < r) {
    auto it2 = s.lower_bound(mp(*it + 1, 0));
    if(it2 != s.end()) {
      int idfk = lower_bound(arr, arr + n, mp(mp(*it, 0), 0)) - arr;
      if(it2->s <= idfk) seg1.inc(it2->s, idfk, wxzs[*it] - wxzs[*it + 1]);
    }
    sum.update(*it, wxzs[*it] - wxzs[*it + 1]);
    it = bk.erase(it);
    if(it == bk.end()) return;
  }
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  pair<int, int> idk[2 * n];
  for(int i = 0; i < 2 * n; i++) {
    cin >> idk[i].f;
    idk[i].s = i;
  }
  sort(idk, idk + 2 * n);
  int cur = 0;
  int idfk[2 * n];
  wxzs[0] = idk[0].f;
  for(int i = 0; i < 2 * n; i++) {
    if(i > 0 && idk[i].f != idk[i - 1].f) {
      sum.update(cur, idk[i].f - idk[i - 1].f);
      bk.insert(cur);
      cur++;
      wxzs[cur] = idk[i].f;
    }
    idfk[i] = cur;
  }
  for(int i = 0; i < 2 * n; i++) {
    if(idk[i].s & 1) arr[idk[i].s / 2].f.s = idfk[i];
    else arr[idk[i].s / 2].f.f = idfk[i];
    arr[i / 2].s = i / 2 + 1;
  }
  sort(arr, arr + n);
  seg1.init(), seg2.init();
  cur = 2e9;
  for(int i = n - 1; i >= 0; i--) {
    if(arr[i].f.s < cur) {
      cur = arr[i].f.s;
      add(i);
    }
    else seg2.upd(i, mp(arr[i].f.s, i));
  }
  for(int i = 0; i < n; i++) {
    // for(int j = 0; j < n; j++) cout << seg1.query(j, j).f << " " << arr[seg1.query(j, j).s].s << "\n";
    cur = seg1.seg[1].s;
    cout << arr[cur].s << " ";
    del(arr[cur].f.f, arr[cur].f.s);
    seg1.upd(cur, mp(2e9, 0));
    auto it = s.erase(s.find(mp(arr[cur].f.s, cur)));
    cur = -1;
    if(it != s.begin()) cur = prev(it)->s;
    int whar = 2e9;
    if(it != s.end()) whar = it->f;
    while(cur < n) {
      auto thing = seg2.query(max(0, cur), n);
      if(thing.f >= whar) break;
      cur = thing.s;
      add(cur);
      seg2.upd(cur, mp(2e9, 0));
    }
  }
  cout << "\n";
}