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: //package codeforces.edu119;
  
  import java.io.*;
  import java.util.*;
  
  import static java.lang.Math.*;
  
  //Think through the entire logic before jump into coding!
  //If you are out of ideas, take a guess! It is better than doing nothing!
  //Read both C and D, it is possible that D is easier than C for you!
  
  //Be aware of integer overflow!
  //If you find an answer and want to return immediately, don't forget to flush before return!
  
  public class E {
      static InputReader in;
      static PrintWriter out;
  
      public static void main(String[] args) {
          //initReaderPrinter(true);
          initReaderPrinter(false);
          //solve(in.nextInt());
          solve(1);
      }
  
      static void solve(int testCnt) {
          for (int testNumber = 0; testNumber < testCnt; testNumber++) {
              int q = in.nextInt();
              List<Integer>[] posList = new List[500001];
              for(int i = 0; i <= 500000; i++) posList[i] = new ArrayList<>();
              int currPos = 0;
              for(int i = 0; i < q; i++) {
                  int type = in.nextInt();
                  if(type == 1) {
                      int x = in.nextInt();
                      posList[x].add(currPos);
                      currPos++;
                  }
                  else {
                      int x = in.nextInt();
                      int y = in.nextInt();
                      if(x != y) {
                          if(posList[x].size() > posList[y].size()) {
                              List<Integer> temp = posList[x];
                              posList[x] = posList[y];
                              posList[y] = temp;
                          }
                          posList[y].addAll(posList[x]);
                          posList[x].clear();
                      }
                  }
              }
              int[] ans = new int[currPos];
              for(int i = 1; i <= 500000; i++) {
                  for(int v : posList[i]) {
                      ans[v] = i;
                  }
              }
              for(int v : ans) out.print(v + " ");
              out.println();
  //            int[] ans = new int[k];
  //            int[] map = new int[500001];
  //            for(int i = 1; i <= 500000; i++) map[i] = i;
  //            int idx = k - 1;
  //            for(int i = q - 1; i >= 0; i--) {
  //                if(queries[i][0] == 1) {
  //                    ans[idx] = map[queries[i][1]];
  //                    idx--;
  //                }
  //                else {
  //                    //map[queries[i][1]] = map[queries[i][2]];
  //                    int curr = map[queries[i][2]];
  //                    while(map[curr] != curr) {
  //                        curr = map[curr];
  //                    }
  //                    map[queries[i][1]] = curr;
  //                }
  //            }
  //            for(int v : ans) out.print(v + " ");
  //            out.println();
          }
          out.close();
      }
  
      static void initReaderPrinter(boolean test) {
          if (test) {
              try {
                  in = new InputReader(new FileInputStream("src/input.in"));
                  out = new PrintWriter(new FileOutputStream("src/output.out"));
              } catch (IOException e) {
                  e.printStackTrace();
              }
          } else {
              in = new InputReader(System.in);
              out = new PrintWriter(System.out);
          }
      }
  
      static class InputReader {
          BufferedReader br;
          StringTokenizer st;
  
          InputReader(InputStream stream) {
              try {
                  br = new BufferedReader(new InputStreamReader(stream), 32768);
              } catch (Exception e) {
                  e.printStackTrace();
              }
          }
  
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          Integer[] nextIntArray(int n) {
              Integer[] a = new Integer[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          int[] nextIntArrayPrimitive(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          int[] nextIntArrayPrimitiveOneIndexed(int n) {
              int[] a = new int[n + 1];
              for (int i = 1; i <= n; i++) a[i] = nextInt();
              return a;
          }
  
          Long[] nextLongArray(int n) {
              Long[] a = new Long[n];
              for (int i = 0; i < n; i++) a[i] = nextLong();
              return a;
          }
  
          long[] nextLongArrayPrimitive(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++) a[i] = nextLong();
              return a;
          }
  
          long[] nextLongArrayPrimitiveOneIndexed(int n) {
              long[] a = new long[n + 1];
              for (int i = 1; i <= n; i++) a[i] = nextLong();
              return a;
          }
  
          String[] nextStringArray(int n) {
              String[] g = new String[n];
              for (int i = 0; i < n; i++) g[i] = next();
              return g;
          }
  
          List<Integer>[] readGraphOneIndexed(int n, int m) {
              List<Integer>[] adj = new List[n + 1];
              for (int i = 0; i <= n; i++) {
                  adj[i] = new ArrayList<>();
              }
              for (int i = 0; i < m; i++) {
                  int u = nextInt();
                  int v = nextInt();
                  adj[u].add(v);
                  adj[v].add(u);
              }
              return adj;
          }
  
          List<Integer>[] readGraphZeroIndexed(int n, int m) {
              List<Integer>[] adj = new List[n];
              for (int i = 0; i < n; i++) {
                  adj[i] = new ArrayList<>();
              }
              for (int i = 0; i < m; i++) {
                  int u = nextInt() - 1;
                  int v = nextInt() - 1;
                  adj[u].add(v);
                  adj[v].add(u);
              }
              return adj;
          }
  
          /*
              A more efficient way of building a graph using int[] instead of ArrayList to store each node's neighboring nodes.
              1-indexed.
           */
          int[][] buildGraph(int nodeCnt, int edgeCnt) {
              int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt];
              int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
              for (int i = 0; i < edgeCnt; i++) {
                  int u = in.nextInt(), v = in.nextInt();
                  edgeCntForEachNode[u]++;
                  edgeCntForEachNode[v]++;
                  end1[i] = u;
                  end2[i] = v;
              }
              int[][] adj = new int[nodeCnt + 1][];
              for (int i = 1; i <= nodeCnt; i++) {
                  adj[i] = new int[edgeCntForEachNode[i]];
              }
              for (int i = 0; i < edgeCnt; i++) {
                  adj[end1[i]][idxForEachNode[end1[i]]] = end2[i];
                  idxForEachNode[end1[i]]++;
                  adj[end2[i]][idxForEachNode[end2[i]]] = end1[i];
                  idxForEachNode[end2[i]]++;
              }
              return adj;
          }
      }
  }