#include <bits/stdc++.h>
using namespace std;
vector<pair<long long int, long long int>> tmp[500005];
vector<long long int> p(500005);
void solve() {
  long long int q1;
  cin >> q1;
  long long int qq = q1;
  vector<long long int> ans;
  vector<vector<long long int>> q;
  for (long long int i = 1; i <= 500004; i++) p[i] = i;
  while (qq--) {
    long long int t, x = -1, y = -1;
    cin >> t;
    if (t == 1) {
      cin >> x;
    } else
      cin >> x >> y;
    q.push_back({t, x, y});
  }
  for (long long int i = q1 - 1; i >= 0; i--) {
    if (q[i][0] == 1) {
      ans.push_back(p[q[i][1]]);
    } else {
      p[q[i][1]] = p[q[i][2]];
    }
  }
  reverse(ans.begin(), ans.end());
  for (long long int i : ans) cout << i << " ";
  cout << endl;
}
int main() {
  solve();
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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;
vector<pair<long long int, long long int>> tmp[500005];
vector<long long int> p(500005);
void solve() {
  long long int q1;
  cin >> q1;
  long long int qq = q1;
  vector<long long int> ans;
  vector<vector<long long int>> q;
  for (long long int i = 1; i <= 500004; i++) p[i] = i;
  while (qq--) {
    long long int t, x = -1, y = -1;
    cin >> t;
    if (t == 1) {
      cin >> x;
    } else
      cin >> x >> y;
    q.push_back({t, x, y});
  }
  for (long long int i = q1 - 1; i >= 0; i--) {
    if (q[i][0] == 1) {
      ans.push_back(p[q[i][1]]);
    } else {
      p[q[i][1]] = p[q[i][2]];
    }
  }
  reverse(ans.begin(), ans.end());
  for (long long int i : ans) cout << i << " ";
  cout << endl;
}
int main() {
  solve();
  return 0;
}

```