#include <bits/stdc++.h>
using namespace std;
void burn() {
  int q;
  cin >> q;
  vector<vector<int>> ques(q);
  map<int, int> init;
  for (int i = 5e5; i; i--) init[i] = i;
  vector<int> ans;
  for (int i = 0; i < q; i++) {
    int in;
    cin >> in;
    if (in == 1) {
      int x;
      cin >> x;
      ques[i] = {x, 1};
    } else {
      int x, y;
      cin >> x >> y;
      ques[i] = {x, y, 2};
    }
  }
  for (int i = q - 1; ~i; i--) {
    if (ques[i].back() == 1) {
      ans.push_back(init[ques[i][0]]);
    } else {
      init[ques[i][0]] = init[ques[i][1]];
    }
  }
  for (int i = ans.size() - 1; ~i; i--) cout << ans[i] << ' ';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    burn();
    cout << '\n';
  }
  return 0;
}

### Prompt

In Cpp, your task is to solve 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;
void burn() {
  int q;
  cin >> q;
  vector<vector<int>> ques(q);
  map<int, int> init;
  for (int i = 5e5; i; i--) init[i] = i;
  vector<int> ans;
  for (int i = 0; i < q; i++) {
    int in;
    cin >> in;
    if (in == 1) {
      int x;
      cin >> x;
      ques[i] = {x, 1};
    } else {
      int x, y;
      cin >> x >> y;
      ques[i] = {x, y, 2};
    }
  }
  for (int i = q - 1; ~i; i--) {
    if (ques[i].back() == 1) {
      ans.push_back(init[ques[i][0]]);
    } else {
      init[ques[i][0]] = init[ques[i][1]];
    }
  }
  for (int i = ans.size() - 1; ~i; i--) cout << ans[i] << ' ';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    burn();
    cout << '\n';
  }
  return 0;
}

```