1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <algorithm>
 6 #include <queue>
 7 #include <stack>
 8 #include <vector>
 9 #define LEN 200010
10 #define ll long long
11 #define eps 1E-8
12 #define mp(a,b) make_pair(a,b)
13 #define INF 0x7fffffff
14
15 using namespace std;
16
17 //UFSet
18 int parent[LEN];
19 void init(){for(int i=0; i<LEN; i++)parent[i] = i;}
20 int Find(int x){return parent[x] == x?x:Find(parent[x]);}
21
22 int main()
23 {
24 //    freopen("in.txt", "r", stdin);
25
26     int n;
27     int q, a, b;
28     while(scanf("%d", &n)!=EOF){
29         init();
30         while(scanf("%d%d%d", &q, &a, &b)!=EOF && q){
31             int pa = Find(a);
32             int pb = Find(b);
33             int ea = Find(n+a);
34             int eb = Find(n+b);
35             switch(q)
36             {
37             case 1:
38                 if(pa==eb) printf("-1\n");
39                 else {
40                     parent[pa] = pb;
41                     parent[ea] = eb;
42                 }
43                 break;
44             case 2:
45                 if(pa==pb)printf("-1\n");
46                 else {
47                     parent[pa] = eb;
48                     parent[ea] = pb;
49                 }
50                 break;
51             case 3:
52                 if(pa==pb) printf("1\n");
53                 else printf("0\n");
54                 break;
55             case 4:
56                 if(pa==eb) printf("1\n");
57                 else printf("0\n");
58                 break;
59             }
60         }
61     }
62     return 0;
63 }