#include<bits/stdc++.h>
#define MAX   100100
#define FOR(i,a,b) for (int i=(a),_b=(b);i<=_b;i=i+1)
#define REP(i,n) for (int i=0,_n=(n);i<_n;i=i+1)
using namespace std;
class DisjointSet {
	private:
	vector<int> label; //label[x] stores the root of x if x is not root, otherwise it stores -(size of x's set).
	public:
	DisjointSet(){}
	DisjointSet(int n) {
		label.assign(n+7,-1); //label should contains at least n+1 elements, as x is 1-indexed.
		//At first, each node is a seperate set of size 1.		
	}
	int find(int x) { //find the root of set which contains x.
		if (label[x]<0) return (x); //x is root iff label[x] is negative.
		label[x]=find(label[x]);
		return (label[x]); //find the root of x by recursion.
	}
	bool join(int a,int b) { // join the sets which contains a and b. Return false iff a and b are already in the same set.
		int x=find(a);
		int y=find(b);
		if (x==y) return (false); //A set contains both a and b.
		if (label[x]>label[y]) swap(x,y); //label[x]>label[y] means size(x)<size(y).
		//We speed up the disjoint set by joinning the smaller set to the bigger set		
		label[x]+=label[y];
		label[y]=x; //Update the label of x and y.		
		return (true);
	}
	int getSize(int x) { //return the size of set which contains x.
		return (-label[find(x)]);
	}
};
//This code is used to solve the problem: http://v...content-available-to-author-only...j.com/problems/IOIBIN/
int main(void) {
	DisjointSet dsu(MAX);
	int q;
	scanf("%d",&q);
	REP(zz,q) {
		int u,v,t;
		scanf("%d%d%d",&u,&v,&t);
		if (t==1) dsu.join(u,v); else printf("%d\n",dsu.find(u)==dsu.find(v));
	}
	return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBNQVggICAxMDAxMDAKI2RlZmluZSBGT1IoaSxhLGIpIGZvciAoaW50IGk9KGEpLF9iPShiKTtpPD1fYjtpPWkrMSkKI2RlZmluZSBSRVAoaSxuKSBmb3IgKGludCBpPTAsX249KG4pO2k8X247aT1pKzEpCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNsYXNzIERpc2pvaW50U2V0IHsKCXByaXZhdGU6Cgl2ZWN0b3I8aW50PiBsYWJlbDsgLy9sYWJlbFt4XSBzdG9yZXMgdGhlIHJvb3Qgb2YgeCBpZiB4IGlzIG5vdCByb290LCBvdGhlcndpc2UgaXQgc3RvcmVzIC0oc2l6ZSBvZiB4J3Mgc2V0KS4KCXB1YmxpYzoKCURpc2pvaW50U2V0KCl7fQoJRGlzam9pbnRTZXQoaW50IG4pIHsKCQlsYWJlbC5hc3NpZ24obis3LC0xKTsgLy9sYWJlbCBzaG91bGQgY29udGFpbnMgYXQgbGVhc3QgbisxIGVsZW1lbnRzLCBhcyB4IGlzIDEtaW5kZXhlZC4KCQkvL0F0IGZpcnN0LCBlYWNoIG5vZGUgaXMgYSBzZXBlcmF0ZSBzZXQgb2Ygc2l6ZSAxLgkJCgl9CglpbnQgZmluZChpbnQgeCkgeyAvL2ZpbmQgdGhlIHJvb3Qgb2Ygc2V0IHdoaWNoIGNvbnRhaW5zIHguCgkJaWYgKGxhYmVsW3hdPDApIHJldHVybiAoeCk7IC8veCBpcyByb290IGlmZiBsYWJlbFt4XSBpcyBuZWdhdGl2ZS4KCQlsYWJlbFt4XT1maW5kKGxhYmVsW3hdKTsKCQlyZXR1cm4gKGxhYmVsW3hdKTsgLy9maW5kIHRoZSByb290IG9mIHggYnkgcmVjdXJzaW9uLgoJfQoJYm9vbCBqb2luKGludCBhLGludCBiKSB7IC8vIGpvaW4gdGhlIHNldHMgd2hpY2ggY29udGFpbnMgYSBhbmQgYi4gUmV0dXJuIGZhbHNlIGlmZiBhIGFuZCBiIGFyZSBhbHJlYWR5IGluIHRoZSBzYW1lIHNldC4KCQlpbnQgeD1maW5kKGEpOwoJCWludCB5PWZpbmQoYik7CgkJaWYgKHg9PXkpIHJldHVybiAoZmFsc2UpOyAvL0Egc2V0IGNvbnRhaW5zIGJvdGggYSBhbmQgYi4KCQlpZiAobGFiZWxbeF0+bGFiZWxbeV0pIHN3YXAoeCx5KTsgLy9sYWJlbFt4XT5sYWJlbFt5XSBtZWFucyBzaXplKHgpPHNpemUoeSkuCgkJLy9XZSBzcGVlZCB1cCB0aGUgZGlzam9pbnQgc2V0IGJ5IGpvaW5uaW5nIHRoZSBzbWFsbGVyIHNldCB0byB0aGUgYmlnZ2VyIHNldAkJCgkJbGFiZWxbeF0rPWxhYmVsW3ldOwoJCWxhYmVsW3ldPXg7IC8vVXBkYXRlIHRoZSBsYWJlbCBvZiB4IGFuZCB5LgkJCgkJcmV0dXJuICh0cnVlKTsKCX0KCWludCBnZXRTaXplKGludCB4KSB7IC8vcmV0dXJuIHRoZSBzaXplIG9mIHNldCB3aGljaCBjb250YWlucyB4LgoJCXJldHVybiAoLWxhYmVsW2ZpbmQoeCldKTsKCX0KfTsKLy9UaGlzIGNvZGUgaXMgdXNlZCB0byBzb2x2ZSB0aGUgcHJvYmxlbTogaHR0cDovL3YuLi5jb250ZW50LWF2YWlsYWJsZS10by1hdXRob3Itb25seS4uLmouY29tL3Byb2JsZW1zL0lPSUJJTi8KaW50IG1haW4odm9pZCkgewoJRGlzam9pbnRTZXQgZHN1KE1BWCk7CglpbnQgcTsKCXNjYW5mKCIlZCIsJnEpOwoJUkVQKHp6LHEpIHsKCQlpbnQgdSx2LHQ7CgkJc2NhbmYoIiVkJWQlZCIsJnUsJnYsJnQpOwoJCWlmICh0PT0xKSBkc3Uuam9pbih1LHYpOyBlbHNlIHByaW50ZigiJWRcbiIsZHN1LmZpbmQodSk9PWRzdS5maW5kKHYpKTsKCX0KCXJldHVybiAwOwp9

OQoxIDIgMiAKMSAyIDEKMyA3IDIKMiAzIDEKMSAzIDIKMiA0IDIKMSA0IDEKMyA0IDIKMSA3IDIK

9
1 2 2 
1 2 1
3 7 2
2 3 1
1 3 2
2 4 2
1 4 1
3 4 2
1 7 2