#include<cstdio>

 using namespace std;

 struct point {

     int l,r;

     int sum,mark;

 };

 point tree[*];

 int a[],b[];

 void build(int i,int left,int right)

 {

     tree[i].l=left,tree[i].r=right;

     tree[i].mark=(tree[i].r-tree[i].l)+;

     tree[i].sum=;

     if (right==left) return;

     int mid=(left+right)/;

     build(i*,left,mid);

     build(i*+,mid+,right);

 }

 void update(int i,int pos,int val)

 {

     if (tree[i].l==tree[i].r)

     {

         tree[i].sum=val;

         tree[i].mark--;

         return ;

     }

     if (pos<=tree[i*].mark)

        update(i*,pos,val);

     else

        update(i*+,pos-tree[i*].mark,val);

     tree[i].mark=tree[i*].mark+tree[i*+].mark; //更新区间的空位

 }

 void check(int i)

 {

     if (tree[i].l==tree[i].r)

     {

        printf("%d ",tree[i].sum);

        return ;

     }

     check(i*);

     check(i*+);

 }

 int main()

 {

     int n,i;

     while (~scanf("%d",&n))

     {

         for (i=;i<=n;i++)

            scanf("%d %d",&a[i],&b[i]);

        build(,,n);

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

            update(,a[i]+,b[i]);

        check();

        printf("\n");

     }

     return ;

 }