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.Arrays;
  import java.util.StringTokenizer;
  
  public class CF_1620E {
  	public static void main(String[] args) throws NumberFormatException, IOException {
  		MyReader reader = new MyReader();
  		int q = reader.nextInt();
  		ArrayList<Pair>[] updates = new ArrayList[q+5];
  		for(int i=0; i<q+5; i++) {
  			updates[i] = new ArrayList<>();
  		}
  		ArrayList<Integer> arr = new ArrayList<>();
  		int[] map = new int[500001];
  		for(int i=0; i<map.length; i++) {
  			map[i] = i;
  		}
  		int ind = 0;
  		for(int i=0; i<q; i++) {
  			int type = reader.nextInt();
  			if(type == 1) {
  				arr.add(reader.nextInt());
  				ind++;
  			}
  			else {
  				updates[ind].add(new Pair(reader.nextInt(), reader.nextInt()));
  			}
  		}
  		
  		int[] res = new int[arr.size()];
  		for(int i=arr.size(); i>=0; i--) {
  			if(i != arr.size()) res[i] = map[arr.get(i)];
  			for(int j=updates[i].size()-1; j>=0; j--) {
  				int x = updates[i].get(j).x;
  				int y = updates[i].get(j).y;
  				map[x] = map[y];
  			}
  		}
  		
  		StringBuilder sb = new StringBuilder();
  		for(int i=0; i<res.length; i++) {
  			sb.append(res[i]);
  			sb.append(" ");
  		}
  		System.out.println(sb);
  	}
  	
  	static class Pair {
  		int x, y;
  		public Pair(int x, int y) {
  			this.x = x;
  			this.y = y;
  		}
  	}
  	
  	
  	static class MyReader {
          BufferedReader br;
          StringTokenizer st;
          public MyReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
          public String next() throws IOException  {
              while(st == null || !st.hasMoreElements()) {
                  st = new StringTokenizer(br.readLine());
              }
              return st.nextToken();
          }
          public int nextInt() throws NumberFormatException, IOException {
              return Integer.parseInt(next());
          }
      }
  }
  