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>
template <typename T>
T power(T a, T b) {
  T ans = 1;
  for (long long int i = 0; i < b; i++) {
    ans *= a;
  }
  return ans;
}
using namespace std;
void solve() {
  long long int q;
  cin >> q;
  vector<long long int*> v, start;
  unordered_map<long long int, vector<long long int*>> um;
  for (long long int i = 0; i < q; i++) {
    long long int num;
    cin >> num;
    if (num == 1) {
      long long int x;
      cin >> x;
      if (um.find(x) == um.end()) {
        long long int* temp = new long long int;
        *temp = x;
        v.push_back(temp);
        um[x] = start;
        um[x].push_back(temp);
      } else {
        v.push_back(um[x][0]);
      }
    } else {
      long long int x, y;
      cin >> x;
      cin >> y;
      if (x == y) break;
      if (um.find(x) != um.end()) {
        if (um.find(y) == um.end()) {
          long long int* temp = new long long int;
          *temp = y;
          um[y] = start;
          um[y].push_back(temp);
          for (long long int j = 0; j < um[x].size(); j++) *um[x][j] = y;
          um[y].insert(um[y].end(), (um[x]).begin(), (um[x]).end());
          um.erase(um.find(x));
        } else {
          for (long long int j = 0; j < um[x].size(); j++) *um[x][j] = y;
          um[y].insert(um[y].end(), (um[x]).begin(), (um[x]).end());
          um.erase(um.find(x));
        }
      }
    }
  }
  for (long long int i = 0; i < v.size(); i++) {
    cout << *v[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
