#include <cstdio>
#include <cstring>
#define isdigit(ch) ((ch) >= '0' && (ch) <= '9')
#define lowbit(x) (x & -x)

template <typename T> T read() {
	T res = 0, f = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;
	for (; isdigit(ch); ch = getchar()) res = (res << 3) + (res << 1) + (ch ^ 48);
	return res * f;
}

template <typename T> void write(T x, char ed = '\n') {
	if (x < 0) putchar('-'), x = -x;
	static int sta[16], top = 0;
	do {
		sta[++top] = x % 10;
		x /= 10;
	} while(x);
	while (top) {
		putchar(sta[top--] ^ 48);
	}
	putchar(ed);
}

const int MAXN = 2e5 + 10;

int n;
int pos[MAXN], val[MAXN], ans[MAXN];
int tree[MAXN];

void add(int x, int y) {
    for (; x <= n; x += lowbit(x)) tree[x] += y;
} 

int ask(int x) {
    int res = 0;
    for (; x; x -= lowbit(x)) res += tree[x];
    return res;
}

int main() {
    freopen("buytickets.in", "r", stdin);
    freopen("buytickets.out", "w", stdout);
    while (scanf("%d", &n) != EOF) {
        memset(tree, 0, sizeof tree);
        for (int i = 1; i <= n; ++i) {
            pos[i] = read<int>(), val[i] = read<int>();
            add(i, 1);
        }
        for (int i = n; i >= 1; --i) {
            int l = 1, r = n;
            while (l < r) {
                int mid = l + ((r - l) >> 1);
                if (ask(mid) <= pos[i]) {
                    l = mid + 1;
                } else {
                    r = mid;
                }
            }
            ans[r] = val[i];
            add(r, -1);
        }
        for (int i = 1; i <= n; ++i) {
            write(ans[i], " \n"[i == n]);
        }
    }
    return 0;
}