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.util.*;
  import java.io.*;
  public class Edu119E{
  	public static void main(String[] main) throws Exception{
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer(br.readLine());
  		PrintWriter out = new PrintWriter(System.out);
  		int q = Integer.parseInt(st.nextToken());
  		String[] instr = new String[q];
  		for(int i = 0; i < q; i++) {
  			instr[i] = br.readLine();
  		}
  		ArrayList<Integer> reverse = new ArrayList<Integer>();
  		HashMap<Integer, Integer> replace = new HashMap<Integer, Integer>();
  		for(int i = q-1; i >= 0; i--) {
  			st = new StringTokenizer(instr[i]);
  			if(Integer.parseInt(st.nextToken()) == 1) {
  				int x = Integer.parseInt(st.nextToken());
  				if(replace.keySet().contains(x))
  					reverse.add(replace.get(x));
  				else
  					reverse.add(x);
  			}
  			else {
  				int x = Integer.parseInt(st.nextToken());
  				int y = Integer.parseInt(st.nextToken());
  				if(replace.keySet().contains(y))
  					replace.put(x, replace.get(y));
  				else
  					replace.put(x, y);
  			}
  		}
  		StringJoiner sj = new StringJoiner(" ");
  		for(int i = reverse.size()-1; i >= 0; i--)
  			sj.add(Integer.toString(reverse.get(i)));
          out.println(sj);
  		out.close();
  	}
  }