# 目次

• 目次
• 解答
  *
  • desc
• コード

# 解答

# desc

# コード

// C++ 14
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <math.h>

#define ll long long
#define Int int
#define loop(x, start, end) for(Int x = start; x < end; x++)
#define loopdown(x, start, end) for(int x = start; x > end; x--)
#define rep(n) for(int x = 0; x < n; x++)
#define span(a,x,y) a.begin()+x,a.begin()+y
#define span_all(a) a.begin(),a.end()
#define len(x) (x.size())
#define last(x) (*(x.end()-1))

using namespace std;

#define MAX_N 10000
#define MAX_Q 100000

#define UNITE 0
#define SAME 1

Int ds_rank[MAX_N];
Int parent[MAX_N];


Int root(Int x) {
    if (x != parent[x]) {
        parent[x] = root(parent[x]);
    }
    
    return parent[x];
}

void unite(Int x, Int y) {
    Int x_root = root(x), y_root = root(y);
    
    if (ds_rank[x_root] > ds_rank[y_root]) {
        parent[y_root] = x_root;
    } else {
        parent[x_root] = y_root;
        if (ds_rank[x_root] == ds_rank[y_root]) ds_rank[y_root]++;
    }
}

bool same(Int x, Int y) {
    return root(x) == root(y);
}

int main(void) {
    int n, q, com, x, y;
    cin >> n >> q;
    
    loop(i,0,n) ds_rank[i] = 0, parent[i] = i;
    
    loop(i,0,q) {
        cin >> com >> x >> y;
        if (com == UNITE) unite(x, y);
        else {
            if (same(x, y)) cout << 1 << endl;
            else cout << 0 << endl;
        }
    }
}