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: import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.StringTokenizer;
  
  public class ReplaceTheNumbers {
  	
  	static class FastReader {
  		
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  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 nextFloat() { return Float.parseFloat(next()); }
   
          double nextDouble() { return Double.parseDouble(next()); }
   
          String nextLine()
          {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
          
          int[] nextArray(int n)
          {
          	int[] a = new int[n];
          	for (int i=0; i<n; i++) {
          		a[i] = this.nextInt();
          	}
          	return a;
          }
          
          long[] nextArrayLong(int n)
          {
          	long[] a = new long[n];
          	for (int i=0; i<n; i++) {
          		a[i] = this.nextLong();
          	}
          	return a;
          }
          
      }
  
  	public static void solve(int q, String[] s) {
  		
  		ArrayList<Integer> list = new ArrayList<Integer>();
  		int[] hm = new int[500001];
  		for (int i=0; i<500001; i++) {
  			hm[i] = i;
  		}
  		StringBuilder ans = new StringBuilder();
  		for (int i=q-1; i>=0 ;i--) {
  			String[] query = s[i].split(" ");
  			if (Integer.parseInt(query[0]) == 1) {
  				int num = Integer.parseInt(query[1]);
  				list.add(hm[num]);
  			}
  			else {
  				int from = Integer.parseInt(query[1]);
  				int to = Integer.parseInt(query[2]);
  				hm[from] = hm[to];
  			}
  		}
  		for (int i=list.size()-1; i>=0; i--) {
  			ans.append(list.get(i) + " ");
  		}
  		System.out.println(ans);
  		
  	}
  
  	public static void main(String[] args) {
  		
  		FastReader in = new FastReader();
  		int q = in.nextInt();
  		String[] s = new String[q];
  		for (int i=0; i<q; i++) {
  			s[i] = in.nextLine();
  		}
  		solve(q, s);
  
  	}
  
  }
  