/*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <fstream>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%lld", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(int i = 0; i < (len); i++)

 #define For(i, a, len) for(int i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Full(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long ULL;

 typedef pair<int, int> pii;

 typedef pair<string, int> psi;

 typedef map<string, int> msi;

 typedef vector<int> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 typedef struct Peo {

     int pos, val;

 }Peo;

 const int maxn =;

 int sum[maxn<<];

 int n;

 Peo p[maxn];

 int ret[maxn];

 void pushUP(int rt) {

     sum[rt] = max(sum[lrt], sum[rrt]);

 }

 void build(int l, int r, int rt) {

     sum[rt] = r - l + ;

     if(l == r) return;

     int m = (l + r) >> ;

     build(l, m, lrt);

     build(m+, r, rrt);

 }

 void update(int p, int l, int r, int rt, int& id) {

     sum[rt]--;

     if(l == r) {

         id = l;

         return;

     }

     int m = (l + r) >> ;

     if(sum[lrt] >= p) update(p, l, m, lrt, id);

     else {

         p -= sum[lrt];

         update(p, m+, r, rrt, id);

     }

 }

 int main() {

     FRead();

     while(~Rint(n)) {

         build(, n, );

         for(int i = n - ; i >= ; i--) {

             Rint(p[i].pos); Rint(p[i].val);

         }

         int id;

         Rep(i, n) {

             update(p[i].pos+, , n, , id);

             ret[id-] = p[i].val;

         }

         Rep(i, n) printf("%d ", ret[i]);

         printf("\n");

     }

     RT ;

 }