You have an array of integers (initially empty).

You have to perform q queries. Each query is of one of two types: 

  * "1 x" — add the element x to the end of the array; 
  * "2 x y" — replace all occurrences of x in the array with y. 



Find the resulting array after performing all the queries.

Input

The first line contains a single integer q (1 ≤ q ≤ 5 ⋅ 10^5) — the number of queries.

Next q lines contain queries (one per line). Each query is of one of two types: 

  * "1 x" (1 ≤ x ≤ 5 ⋅ 10^5); 
  * "2 x y" (1 ≤ x, y ≤ 5 ⋅ 10^5). 



It's guaranteed that there is at least one query of the first type.

Output

In a single line, print k integers — the resulting array after performing all the queries, where k is the number of queries of the first type.

Examples

Input


7
1 3
1 1
2 1 2
1 2
1 1
1 2
2 1 3


Output


3 2 2 3 2 

Input


4
1 1
1 2
1 1
2 2 2


Output


1 2 1 

Input


8
2 1 4
1 1
1 4
1 2
2 2 4
2 4 3
1 2
2 2 7


Output


1 3 3 7 

Note

In the first example, the array changes as follows:

[] → [3] → [3, 1] → [3, 2] → [3, 2, 2] → [3, 2, 2, 1] → [3, 2, 2, 1, 2] → [3, 2, 2, 3, 2].

In the second example, the array changes as follows:

[] → [1] → [1, 2] → [1, 2, 1] → [1, 2, 1].

In the third example, the array changes as follows:

[] → [] → [1] → [1, 4] → [1, 4, 2] → [1, 4, 4] → [1, 3, 3] → [1, 3, 3, 2] → [1, 3, 3, 7].
1
1 50
 1
1 114514
 1
1 2002
 1
1 500

50 
 114514 
 2002 
 500 

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>

using namespace __gnu_pbds;
using namespace std;

#define pr pair<int,int>
#define ll long long
#define all(v) v.begin(),v.end()
#define loop(i, n) for(int (i)=0 ; (i)<(n) ; (i)++)
#define rep(i, x, y) for(int (i)=(x) ; (i)<=(y) ; (i)++)
typedef tree<
        int,
        null_type,
        less<>,
        rb_tree_tag,
        tree_order_statistics_node_update>
        os;
const int N = 5e5 + 5, MOD = 1e9 + 7, INF = 1e9;
vector<pr > goTo[N];

int binary(int x, int i) {
    int st = 0, en = (int) goTo[x].size() - 1;
    while (st <= en) {
        int mid = (st + en) / 2;
        if (goTo[x][mid].second > i) {
            en = mid - 1;
        } else {
            st = mid + 1;
        }
    }
    return en + 1;
}

int getNumber(int x, int i) {
    int ind = binary(x, i);
    if (ind >= goTo[x].size() or goTo[x][ind].first == x)return x;
    return goTo[x][ind].first = getNumber(goTo[x][ind].first, goTo[x][ind].second);
}

void solve() {
    vector<pr> nums;
    int q;
    cin >> q;
    loop(i, q) {
        int qt, x, y;
        cin >> qt;
        if (qt == 1) {
            cin >> x;
            nums.emplace_back(x,i);
        } else {
            cin >> x >> y;
            if(x==y)continue;
            goTo[x].emplace_back(y,i);
        }
    }
    for (auto & num : nums) {
        cout << getNumber(num.first, num.second) << " ";
    }
    cout << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    //  freopen("out.csv", "w", stdout);
#endif
    int t;
    t = 1;
    while (t--) {
        solve();
    }
}