description: 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].
solution: #include <bits/stdc++.h>
  using namespace std;
  void __print(int x) { cout << x; }
  void __print(long x) { cout << x; }
  void __print(long long x) { cout << x; }
  void __print(unsigned x) { cout << x; }
  void __print(unsigned long x) { cout << x; }
  void __print(unsigned long long x) { cout << x; }
  void __print(float x) { cout << x; }
  void __print(double x) { cout << x; }
  void __print(long double x) { cout << x; }
  void __print(char x) { cout << '\'' << x << '\''; }
  void __print(const char *x) { cout << '\"' << x << '\"'; }
  void __print(const string &x) { cout << '\"' << x << '\"'; }
  void __print(bool x) { cout << (x ? "true" : "false"); }
  template <typename T, typename V>
  void __print(const pair<T, V> &x) {
    cout << '{';
    __print(x.first);
    cout << ',';
    __print(x.second);
    cout << '}';
  }
  template <typename T>
  void __print(const T &x) {
    int first = 0;
    cout << '{';
    for (auto &i : x) cout << (first++ ? "," : ""), __print(i);
    cout << "}";
  }
  void _print() { cout << "]\n"; }
  template <typename T, typename... V>
  void _print(T t, V... v) {
    __print(t);
    if (sizeof...(v)) cout << ", ";
    _print(v...);
  }
  int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ;
    unordered_map<long long, long long> mp;
    const int N = 5e5 + 10;
    for (int i = 0; i < N; i++) mp[i] = i;
    vector<long long> ans;
    int n;
    cin >> n;
    vector<vector<int>> x(n);
    for (int i = 0; i < n; i++) {
      int y;
      cin >> y;
      x[i].push_back(y);
      if (y == 1) {
        int a;
        cin >> a;
        x[i].push_back(a);
      } else {
        int a, b;
        cin >> a >> b;
        x[i].push_back(a);
        x[i].push_back(b);
      }
    }
    reverse((x).begin(), (x).end());
    for (int i = 0; i < n; i++) {
      if (x[i][0] == 1) {
        ans.push_back(mp[x[i][1]]);
      } else {
        mp[x[i][1]] = mp[x[i][2]];
      }
    }
    reverse((ans).begin(), (ans).end());
    for (auto it : ans) cout << it << " ";
    cout << endl;
    return 0;
  }
  