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].
1
1 50
 1
1 114514
 1
1 2002
 1
1 500

50 
 114514 
 2002 
 500 

import java.util.*;
import java.io.*;

public class Main {
	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 nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	public static void sort(long[] a) {
		ArrayList<Long> arr = new ArrayList<>();
		for (int i = 0; i < a.length; i++)
			arr.add(a[i]);
		Collections.sort(arr);
		for (int i = 0; i < arr.size(); i++)
			a[i] = arr.get(i);
	}

	public static void revsort(long[] a) {
		ArrayList<Long> arr = new ArrayList<>();
		for (int i = 0; i < a.length; i++)
			arr.add(a[i]);
		Collections.sort(arr, Collections.reverseOrder());
		for (int i = 0; i < arr.size(); i++)
			a[i] = arr.get(i);
	}

	//Cover the small test cases like for n=1 .
    public static class pair
    {
    	int a;
    	int b;
    	int c;
    	pair(int a,int b,int c)
    	{
    		this.a=a;
    		this.b=b;
    		this.c=c;
    	}
    }
	public static void main(String[] args) {
		FastReader obj = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		int len = obj.nextInt();
		Vector<pair> v=new Vector<>();
		int sz=0;
		while (len-- != 0) {
            int a=obj.nextInt();
            if(a==1)
            {
            	int b=obj.nextInt();
            	v.add(new pair(a,b,0));
            	sz+=1;
            }
            else {
            	int b=obj.nextInt();
            	int c=obj.nextInt();
            	v.add(new pair(a,b,c));
            }
		}
		int[] num=new int[sz];
		HashMap<Integer,Integer> map=new HashMap<>();
		int j=sz-1;
		for(int i=v.size()-1;i>=0;i--)
		{
			if(v.get(i).a==1)
			{
				num[j]=map.get(v.get(i).b)==null?v.get(i).b:map.get(v.get(i).b);
				j--;
			}
			else 
			{
			   map.put(v.get(i).b, v.get(i).c);
			}
		}
		for(int i=0;i<sz;i++)System.out.print(num[i]+" ");
		System.out.println();
		out.flush();
	}

}