#include <iostream>

 #include <cstdio>

 #include <cmath>

 #include <string>

 #include <cstring>

 #include <algorithm>

 #include <limits>

 #include <vector>

 #include <stack>

 #include <queue>

 #include <set>

 #include <map>

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

 #define pi 3.141592653589793

 #define e 2.718281828459045

 #define INF 0x3f3f3f3f

 #define HalF (l + r)>>1

 #define lsn rt<<1

 #define rsn rt<<1|1

 #define Lson lsn, l, mid

 #define Rson rsn, mid+1, r

 #define QL Lson, ql, qr

 #define QR Rson, ql, qr

 #define myself rt, l, r

 using namespace std;

 typedef unsigned long long ull;

 typedef long long ll;

 const int maxN = 2e5 + ;

 int tree[maxN<<], N, pos[maxN], val[maxN], ans[maxN];

 inline void pushup(int rt) { tree[rt] = tree[lsn] + tree[rsn]; }

 inline void buildTree(int rt, int l, int r)

 {

     if(l == r) { tree[rt] = ; return; }

     int mid = HalF;

     buildTree(Lson);

     buildTree(Rson);

     pushup(rt);

 }

 inline void update(int rt, int l, int r, int qx, int num)

 {

     if(l == r)

     {

         tree[rt] = ;

         ans[l] = num;

         return;

     }

     int mid = HalF;

     if(qx <= tree[lsn]) update(Lson, qx, num);

     else update(Rson, qx - tree[lsn], num);

     pushup(rt);

 }

 int main()

 {

     while(scanf("%d", &N) != EOF)

     {

         buildTree(, , N);

         for(int i=; i<=N; i++) scanf("%d%d", &pos[i], &val[i]);

         for(int i=N; i>=; i--) update(, , N, pos[i] + , val[i]);

         for(int i=; i<=N; i++) printf("%d%c", ans[i], i == N ? '\n' : ' ');

     }

     return ;

 }