#include<bits/stdc++.h>
using namespace std;
const int N = 1010000;
int Node[N]={0};
int q;
void func_1(){
	int x,y;
	scanf("%d%d",&x,&y);
	Node[y] = Node[x];
	Node[x] = y;
}
void func_2(){
	int x;
	scanf("%d",&x);
	printf("%d\n",Node[x]);
}
void func_3(){
	int x;
	scanf("%d",&x);
	Node[x] = Node[Node[x]];
}
int main(){
	scanf("%d",&q);
	for(int i = 1;i <= q;i++){
		int n;
		scanf("%d",&n);
		switch (n){
			case 1: func_1(); break;
			case 2: func_2(); break;
			case 3: func_3(); break;
		}
	}
	return 0;
}