1 #include<iostream>
 2 #include<algorithm>
 3 #include<cstdio>
 4 #include<cstring>
 5 #include<queue>
 6 #include<string>
 7 #include<cmath>
 8 using namespace std;
 9 const int N = 200010;
10 int T,tot;
11 int pre[N],vis[N];
12 struct TT
13 {
14     int x,y;
15 }a[N];
16 int lowbit(int x)
17 {
18     return x&(-x);
19 }
20 void init()
21 {
22     for(int i=1;i<=T;i++)
23       vis[i] =lowbit(i);
24 }
25 int sum(int x)
26 {
27     int ans = 0;
28     while(x>0)
29     {
30         ans = ans+vis[x];
31         x = x-lowbit(x);
32     }
33     return ans;
34 }
35 int update(int x)
36 {
37     while(x<=T)
38     {
39         vis[x] = vis[x] - 1;
40         x = x +lowbit(x);
41     }
42 }
43 void add(int x,int y)
44 {
45     int l=1,r=T,mid;
46     while(l<r)
47     {
48         //printf("l === %d %d %d\n",l,r,mid);
49         mid = (l+r)/2;
50         if(sum(mid)>=x) r = mid;
51         else l = mid+1;
52     }
53     //printf("l = %d\n",l);
54     update(l);
55     pre[l] = y;
56 }
57 int main()
58 {
59 int aa,bb;
60   while(~scanf("%d",&T))
61   {
62       init();
63       for(int i=1;i<=T;i++)
64       {
65         scanf("%d %d",&aa,&bb);
66         a[i].x = aa+1;
67         a[i].y = bb;
68       }
69       for(int i=T;i>0;i--)
70           add(a[i].x,a[i].y);
71       for(int i=1;i<=T;i++)
72       {
73             if(i==1) printf("%d",pre[i]);
74             else printf(" %d",pre[i]);
75       }
76       printf("\n");
77   }
78   return 0;
79 }