#include <bits/stdc++.h>
using namespace std;
int n;
int fa[500005];
int op[500005];
int x[500005];
int y[500005];
int ans[500005];
int top = 0;
int main() {
  int n;
  cin >> n;
  int i = 1;
  while (i <= 500000) {
    fa[i] = i;
    i++;
  }
  i = 1;
  while (i <= n) {
    scanf("%d", &op[i]);
    if (op[i] == 1) {
      scanf("%d", &x[i]);
    } else {
      scanf("%d%d", &x[i], &y[i]);
    }
    i++;
  }
  i = n;
  while (i >= 1) {
    if (op[i] == 1) {
      top++;
      ans[top] = fa[x[i]];
    } else {
      fa[x[i]] = fa[y[i]];
    }
    i--;
  }
  i = top;
  while (i >= 1) {
    cout << ans[i] << " ";
    i--;
  }
  cout << endl;
  return 0;
}

### Prompt

Develop a solution in cpp 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;
int n;
int fa[500005];
int op[500005];
int x[500005];
int y[500005];
int ans[500005];
int top = 0;
int main() {
  int n;
  cin >> n;
  int i = 1;
  while (i <= 500000) {
    fa[i] = i;
    i++;
  }
  i = 1;
  while (i <= n) {
    scanf("%d", &op[i]);
    if (op[i] == 1) {
      scanf("%d", &x[i]);
    } else {
      scanf("%d%d", &x[i], &y[i]);
    }
    i++;
  }
  i = n;
  while (i >= 1) {
    if (op[i] == 1) {
      top++;
      ans[top] = fa[x[i]];
    } else {
      fa[x[i]] = fa[y[i]];
    }
    i--;
  }
  i = top;
  while (i >= 1) {
    cout << ans[i] << " ";
    i--;
  }
  cout << endl;
  return 0;
}

```