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].
1
1 50
 1
1 114514
 1
1 2002
 1
1 500

50 
 114514 
 2002 
 500 

#include <bits/stdc++.h>
using namespace std;
int parent[500005];
int find_set(int a) {
  if (a == parent[a]) return a;
  return parent[a] = find_set(parent[a]);
}
void union_set(int u, int v) {
  u = find_set(u);
  v = find_set(v);
  if (u == v) return;
  parent[u] = v;
}
void init() {
  for (int i = 0; i < 500005; i++) {
    parent[i] = i;
  }
}
void solve() {
  init();
  long long q;
  cin >> q;
  vector<pair<int, pair<int, int>>> queries;
  vector<int> a;
  for (int i = 0; i < q; i++) {
    long long type, x, y;
    cin >> type;
    if (type == 1) {
      cin >> x;
      queries.push_back({1, {x, 0}});
    } else {
      cin >> x >> y;
      queries.push_back({2, {x, y}});
    }
  }
  for (int i = 0; i < q; i++) {
    long long type = queries[i].first;
    if (type == 1 && i != q - 1) {
      long long x = queries[i].second.first;
      a.push_back(x);
    } else if (type == 1 && i == q - 1) {
      long long x = queries[i].second.first;
      a.push_back(x);
      for (int i = 0; i < a.size(); i++) {
        cout << find_set(a[i]) << " ";
      }
    } else if (type == 2 && ((i == q - 1) || (queries[i + 1].first == 1))) {
      long long x, y;
      x = queries[i].second.first;
      y = queries[i].second.second;
      union_set(x, y);
      for (int i = 0; i < a.size(); i++) {
        cout << find_set(a[i]) << " ";
      }
      for (int i = 0; i < a.size(); i++) {
        parent[a[i]] = a[i];
      }
      parent[x] = x;
      a.clear();
    } else {
      long long x, y;
      x = queries[i].second.first;
      y = queries[i].second.second;
      union_set(x, y);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long test = 1;
  while (test--) {
    solve();
  }
  return 0;
}
