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.*;
  import java.util.*;
  
  public class Main {
  	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  	static StringTokenizer st;
  	static PrintWriter pr = new PrintWriter(System.out);
  	static String readLine() throws IOException {
  		return br.readLine();
  	}
  	static String next() throws IOException {
  		while (st == null || !st.hasMoreTokens())
  			st = new StringTokenizer(readLine());
  		return st.nextToken();
  	}
  	static int readInt() throws IOException {
  		return Integer.parseInt(next());
  	}
  	static long readLong() throws IOException {
  		return Long.parseLong(next());
  	}
  	static double readDouble() throws IOException {
  		return Double.parseDouble(next());
  	}
  	static char readChar() throws IOException {
  		return next().charAt(0);
  	}
  	static class Pair implements Comparable<Pair> {
  		int f, s;
  		Pair(int f, int s) {
  			this.f = f;
  			this.s = s;
  		}
  		public int compareTo(Pair other) {
  			if (this.f != other.f) return this.f - other.f;
  			return this.s - other.s;
  		}
  	}
  	final static int M = 500000;
  	static void solve() throws IOException {
  		int q = readInt(), op[] = new int[q + 1], x[] = new int[q + 1], y[] = new int[q + 1];
  		for (int i = 1; i <= q; ++i) {
  			op[i] = readInt();
  			x[i] = readInt();
  			if (op[i] == 2) y[i] = readInt();
  		}
  		int f[] = new int[M + 1];
  		for (int i = 1; i <= M; ++i) f[i] = i;
  		List<Integer> ans = new ArrayList();
  		for (int i = q; i >= 1; --i) {
  			if (op[i] == 1) ans.add(f[x[i]]);
  			else f[x[i]] = f[y[i]];
  		}
  		Collections.reverse(ans);
  		for (int i : ans) pr.print(i + " ");
  		pr.println();
  	}
  	public static void main(String[] args) throws IOException {
  		solve();
  		//for (int t = readInt(); t > 0; --t) solve();
  		pr.close();
  	}
  }
  