#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long int n;
  cin >> n;
  map<long long int, long long int> m;
  vector<long long int> a(n);
  vector<pair<long long int, long long int>> b(n);
  vector<long long int> ans;
  for (long long int i = 0; i < n; ++i) {
    long long int o;
    cin >> o;
    if (o == 1) {
      long long int x;
      cin >> x;
      a[i] = x;
      m[x] = x;
    } else {
      a[i] = 0;
      long long int x, y;
      cin >> x >> y;
      b[i].first = x;
      b[i].second = y;
      m[y] = y;
    }
  }
  for (long long int i = n - 1; i >= 0; --i) {
    if (a[i] == 0) {
      m[b[i].first] = m[b[i].second];
    } else {
      ans.push_back(m[a[i]]);
    }
  }
  for (auto i = ans.rbegin(); i != ans.rend(); ++i) cout << *i << " ";
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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].

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long int n;
  cin >> n;
  map<long long int, long long int> m;
  vector<long long int> a(n);
  vector<pair<long long int, long long int>> b(n);
  vector<long long int> ans;
  for (long long int i = 0; i < n; ++i) {
    long long int o;
    cin >> o;
    if (o == 1) {
      long long int x;
      cin >> x;
      a[i] = x;
      m[x] = x;
    } else {
      a[i] = 0;
      long long int x, y;
      cin >> x >> y;
      b[i].first = x;
      b[i].second = y;
      m[y] = y;
    }
  }
  for (long long int i = n - 1; i >= 0; --i) {
    if (a[i] == 0) {
      m[b[i].first] = m[b[i].second];
    } else {
      ans.push_back(m[a[i]]);
    }
  }
  for (auto i = ans.rbegin(); i != ans.rend(); ++i) cout << *i << " ";
}

```