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>
#define ll long long
using namespace std;
struct piii{
    int F, S, pos;
};
vector<int> a;
vector<piii> rep;
int trace[500005];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int q;
    cin >> q;
    while (q--) {
        int t, x, y;
        cin >> t;
        if (t == 1) {
            cin >> x;
            a.push_back(x);
            trace[x] = x;
        }
        else {
            cin >> x >> y;
            if (a.size() > 0) {
                rep.push_back({x, y, a.size() - 1});
            }
        }
    }
    int n = rep.size() - 1;
    for (int i = a.size() - 1; i >= 0; i--) {
        int dem = 0;
        while (rep[n].pos == i && n >= 0) {
            trace[rep[n].F] = rep[n].S;
            n--;
            dem++;
        }
        for (int j = 1; j <= dem; j++)
            a[i] = trace[a[i]];
        if(dem==0)
            a[i] = trace[a[i]];
    }
    for (int i : a)
        cout << i << " ";
}
