#include <bits/stdc++.h>
using namespace std;
int inf = 1e9;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  vector<vector<int>> p(1000000 + 13);
  int h = 0;
  for (int _ = 0; _ < t; _++) {
    int c;
    cin >> c;
    if (c == 1) {
      int x;
      cin >> x;
      p[x].push_back(h++);
    } else {
      int x, y;
      cin >> x >> y;
      if (x != y) {
        if (p[x].size() > p[y].size()) swap(p[x], p[y]);
        for (auto i : p[x]) p[y].push_back(i);
        p[x].clear();
      }
    }
  }
  vector<int> ans(h);
  for (int i = 0; i < p.size(); i++) {
    for (auto j : p[i]) {
      ans[j] = i;
    }
  }
  for (int i = 0; i < h; i++) {
    cout << ans[i] << ' ';
  }
  return 0;
}

### Prompt

Generate a CPP solution to the following problem:

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;
int inf = 1e9;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  vector<vector<int>> p(1000000 + 13);
  int h = 0;
  for (int _ = 0; _ < t; _++) {
    int c;
    cin >> c;
    if (c == 1) {
      int x;
      cin >> x;
      p[x].push_back(h++);
    } else {
      int x, y;
      cin >> x >> y;
      if (x != y) {
        if (p[x].size() > p[y].size()) swap(p[x], p[y]);
        for (auto i : p[x]) p[y].push_back(i);
        p[x].clear();
      }
    }
  }
  vector<int> ans(h);
  for (int i = 0; i < p.size(); i++) {
    for (auto j : p[i]) {
      ans[j] = i;
    }
  }
  for (int i = 0; i < h; i++) {
    cout << ans[i] << ' ';
  }
  return 0;
}

```