#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,g[2*10^5+1];
struct node{
    ll p,v;
}a[2*10^5+1];

int main(){
    freopen("buytickets.in","r",stdin);
    freopen("buytickets.out","w",stdout);
    while(cin>>n){
        for(int i=1;i<=n;i++){
            cin>>a[i].p>>a[i].v;
            for(int j=i+1;j>=a[i].p+1;j--) 
                g[j]=g[j-1];
            g[a[i].p+1]=a[i].v;
        }
        for(int i=1;i<=n;i++) cout<<g[i]<<" ";
        cout<<endl;
    }
    return 0;
}