#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
using namespace std;
void stress();
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    srand(time(0));
    stress();
}

#define int long long


void solveA()
{
    set<pair<int,int>> s;
    int n;
    cin >> n;
    for (int i = 0; i<n; i++)
    {
        int x;
        cin >> x;
        if (x == 1)
        {
            int z;
            cin >> z;
            if (s.empty())
            {
                s.insert({1,z});
            }
            else
            {
                s.insert({prev(s.end())->first+1,z});
            }
        }
        else {
            int a, b;
            cin >> a >> b;
            for (int j = 0; j < b; j++) {
                auto it = s.lower_bound({a,-1});
                s.insert({prev(s.end())->first+1,it->second});
                s.erase(it);
            }
        }
    }
    for (auto it:s)
        cout << it.second << " ";
}
int x[302];
int n,L;
int dp[302][302];
int f(int l, int r)
{
    if (l+1 == r)
        return 0;
    if (dp[l][r]!=-1)
        return dp[l][r];
    int ans = 0;
    int len = x[r]-x[l];

    for (int j = l+1; j<r; j++)
    {
        ans = max(ans,len*len + f(l,j) + f(j,r));
    }
    return dp[l][r] = ans;
}
void solveB()
{
    cin >> n >> L;
    for (int i = 0; i<n; i++)
        cin >> x[i];
    sort(x,x+n);
    int l = 0, r = n-1;
    int ans = 0;
    int left = 0, right = L;
    while (l<=r)
    {
        int cutleft = x[l]-left;
        int cutright = right - x[r];
        ans+=L*L;
        if (cutleft<=cutright)
        {
            L-=cutleft;
            left = x[l];
            l++;
        }
        else
        {
            L -= cutright;
            right = x[r];
            r--;
        }
    }
    cout << ans;
}
void solveD()
{
    int n;
    cin >> n;
    vector<int> mn(1001,1e9);
    vector<int> a(n);
    for (int i = 0; i<n; i++)
        cin >> a[i];
    sort(a.begin(),a.end());
    int m;
    cin >> m;
    for (int i = 0; i<m; i++)
    {
        int x,y;
        cin >> x >> y;
        mn[x] = min(mn[x],y);
    }
    int sum = 0;
    int cost = 1e9;
    int j = 1000;
    for (int i = n-1; i>=0; i--)
    {
        while (j>=a[i])
            cost = min(cost,mn[j]),j--;
        sum+=cost;

    }
    cout << sum;

}
void stress() {
    solveA();
 //   solveB();
//    solveD();
}