pku 2828

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <list>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

#define PF(x) (scanf("%d",&x))
#define PT(x,y) (scanf("%d%d",&x,&y))
#define PR(x) (printf("%d\n",x))
#define PRT(x,y)(printf("%d %d\n",x,y))
#define PB(x)(scanf("%I64d",&x))
#define PRB(x)(printf("%I64d\n",(x)))
typedef __int64 LL;
#define N 200005
#define M 105
#define Mod 1000
#define Inf 0x7fffffff
#define L(x) (x<<1)
#define R(x) ((x<<1)|1)
#define For(i,n) for(int i=0;i<n;i++)
#define lowbit(x) (x) & (-x)
#define mid(x,y) ((x+y)>>1)

struct tree
{
	int l,r;
	int sum;
};
struct ele
{
	int pos,var;
	void in()
	{
		PT(pos,var);
	}
};
ele arr[N];
tree T[4*N];
int n;
int ar[N];

inline int maxx(int a,int b)
{
	return a>b?a:b;
}
inline int minx(int a,int b)
{
	return a>b?b:a;
}
void build(int l,int r,int k)
{
    T[k].l = l;
	T[k].r = r;
	T[k].sum = r-l+1;
	if(l == r) return ;
    int mi = mid(l,r);
	build(l,mi,L(k));
	build(mi+1,r,R(k));
}

void update(int pos,int k,int var)
{
	if(T[k].l == T[k].r)
	{
		ar[T[k].l] = var;
		T[k].sum = 0;
		return ;
	}
	if(T[L(k)].sum>=pos+1) update(pos,L(k),var);
	else update(pos-T[L(k)].sum,R(k),var);
	T[k].sum = T[L(k)].sum + T[R(k)].sum;
}
void init()
{
	while(scanf("%d",&n)!=EOF)
	{

		build(1,n,1);
       For(i,n)
	   {
		   arr[i].in();
	   }
	   for(int i=n-1;i>=0;i--)
	   {
		   update(arr[i].pos,1,arr[i].var);
	   }
	   For(i,n)
	   {
		   if(i==0) printf("%d",ar[i+1]);
		   else printf(" %d",ar[i+1]);
	   }
	   puts("");
	}
	return ;
}

int main()
{
	init();
	return 0;
}