#include <bits/stdc++.h>
using namespace std;
const long long N = 5 * 1e5 + 1;
int main() {
  long long q;
  cin >> q;
  vector<long long> v(N);
  for (int i = 0; i <= N; i++) {
    v[i] = i;
  }
  deque<long long> dq;
  vector<pair<long long, long long>> pq(q);
  long long idx = 0;
  while (q--) {
    long long a;
    cin >> a;
    if (a == 1) {
      long long b;
      cin >> b;
      pq[idx].first = b;
      pq[idx].second = 0;
      idx++;
    } else {
      long long b, c;
      cin >> b >> c;
      pq[idx].first = b;
      pq[idx].second = c;
      idx++;
    }
  }
  for (int i = idx - 1; i >= 0; i--) {
    if (pq[i].first != 0 && pq[i].second != 0) {
      v[pq[i].first] = v[pq[i].second];
    } else {
      dq.push_front(v[pq[i].first]);
    }
  }
  for (auto it : dq) {
    cout << it << " ";
  }
  cout << endl;
  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;
const long long N = 5 * 1e5 + 1;
int main() {
  long long q;
  cin >> q;
  vector<long long> v(N);
  for (int i = 0; i <= N; i++) {
    v[i] = i;
  }
  deque<long long> dq;
  vector<pair<long long, long long>> pq(q);
  long long idx = 0;
  while (q--) {
    long long a;
    cin >> a;
    if (a == 1) {
      long long b;
      cin >> b;
      pq[idx].first = b;
      pq[idx].second = 0;
      idx++;
    } else {
      long long b, c;
      cin >> b >> c;
      pq[idx].first = b;
      pq[idx].second = c;
      idx++;
    }
  }
  for (int i = idx - 1; i >= 0; i--) {
    if (pq[i].first != 0 && pq[i].second != 0) {
      v[pq[i].first] = v[pq[i].second];
    } else {
      dq.push_front(v[pq[i].first]);
    }
  }
  for (auto it : dq) {
    cout << it << " ";
  }
  cout << endl;
  return 0;
}

```