#define _for(i,a,b) for(int i = (a);i < (b);i ++)
const int maxn = 50003;
int par[maxn]; //父亲
int high[maxn]; //树的高度void init(int n)
{_for(i,0,n){par[i] = i;high[i] = 0;}
} int find(int x)
{return par[x] == x ? x : par[x] = find(par[x]);
}void unite(int x,int y)
{x = find(x);y = find(y);if(x==y) return ;if(high[x]<high[y])par[x] = y;else{par[y] = x;if(high[x]==high[y])high[x] ++;}
}bool same(int x,int y)
{return find(x) == find(y);
}

#define _for(i,a,b) for(int i = (a);i < (b);i ++)
const int maxn = 50003;
int par[maxn]; //父亲 void init(int n)
{_for(i,0,n)par[i] = i;
} int find(int x)
{return par[x] == x ? x : find(par[x]);
}void unite(int x,int y)
{x = find(x);y = find(y);if(x==y) return ;   par[x] = y;
}bool same(int x,int y)
{return find(x) == find(y);
}

#include <bits/stdc++.h>
using namespace std;#define _for(i,a,b) for(int i = (a);i < (b);i ++)
const int maxn = 50003;
int par[maxn]; //父亲
int high[maxn]; //树的高度
int id[maxn]; //映射，里面装的是现在真正的序号
int idEnd;
void init(int n)
{idEnd = n;_for(i,0,n){par[i] = id[i] = i;high[i] = 0;}
} int find(int x)
{return par[x] == x ? x : par[x] = find(par[x]);
}void unite(int x,int y)
{x = find(x);y = find(y);if(x==y) return ;if(high[x]<high[y])par[x] = y;else{par[y] = x;if(high[x]==high[y])high[x] ++;}
}void del(int x)
{id[x] = idEnd ++;high[id[x]] = 0;par[id[x]] = id[x];
}bool same(int x,int y)
{return find(x) == find(y);
}int main()
{init(7);unite(id[1],id[4]);unite(id[2],id[4]);unite(id[3],id[4]);unite(id[4],id[5]);unite(id[6],id[5]);cout << same(id[4],id[5]) << endl;del(id[4]);cout << same(id[4],id[5]) << endl;cout << same(id[1],id[5]) << endl;cout << same(id[6],id[2]) << endl;return 0;
}

map<string,int> IDcache;
vector<string> Stringcache;int ID(string s)
{if(IDcache.count(s)) return IDcache[s];Stringcache.push_back(s);return IDcache[s] = Stringcache.size()-1;
}