#include <iostream>
using namespace std;
//typedef int ElementType;
//typedef int SetName;
//typedef ElementType SetType[MaxSize];
//找到X所在的集合
int s[10001];
int Find(int X) {if (s[X] < 0) return X;else return s[X] = Find(s[X]);
}
void f1(int X1, int X2) {if (Find(X1) == Find(X2)) cout << "yes" << endl;else cout << "no" << endl;
}void Union(int X1, int X2) {int root1 = Find(X1);//X1的树根int root2 = Find(X2);if (root1 < root2) {//说明第一个集合里元素个数多s[root1] += s[root2];//cout << "把" << X1 << "的根节点的值修改为" << s[root1] << endl;s[root2] = root1;//cout << "把" << X2 << "的根节点的值修改为" << s[root2] << endl;}if (root1 > root2) {s[root2] += s[root1];//cout << "把" << X2 << "的根节点的值修改为" << s[root2] << endl;s[root1] = root2;//cout << "把" << X1 << "的根节点的值修改为" << s[root1] << endl;}
}int GetNum(int n) {int temp = 0;for (int i = 1; i <= n; i++) {if (s[i] <0) temp++;}return temp;
}int main() {int N; cin >> N;for (int i = 1; i <= N; i++) s[i] = -1;char choice=NULL;int X1, X2;while (cin >> choice) {switch (choice) {case 'I': {cin >> X1 >> X2;Union(X1, X2);break;}case 'C': {cin >> X1 >> X2;f1(X1, X2);break;}case 'S': {if (GetNum(N) == 1) cout << "The network is connected." << endl;else cout << "There are " << GetNum(N) << " components." << endl;return 0;}}}
}

#include <iostream>
#include <stack>
#include <list>
using namespace std;
typedef BinNode* Bintree; //二叉树
struct BinNode {char data;BinNode* left;BinNode* right;
}; //二叉树节点stack<BinNode>S;//二叉树堆栈
//中序遍历
void InOrderTaversal(Bintree BT) {Bintree T = BT;//BT指向树根while (T || !S.empty()) {while (T) { //其实这是递归S.push(*T);T = T->left;}//循环结束说明左边的树空了if (!S.empty()) {//一定到达边界了（T=NULL），可能左树为空，可能右树为空//如果左树为空，只要有节点为空说明可以出栈了*T = S.pop();cout << (*T).data;T = T->right;}}
}

void PreOrderTaversal(Bintree BT) {Bintree T = BT;//BT指向树根while (T || !S.empty()) {while (T) { //其实这是递归S.push(*T);cout << (*T).data;T = T->left;}//循环结束说明左边的树空了if (!S.empty()) {//一定到达边界了（T=NULL），可能左树为空，可能右树为空//如果左树为空，只要有节点为空说明可以出栈了*T = S.pop();T = T->right;}}
}

stack<BinNode2>s;
void postOrder2(BinTree BT)    //非递归后序遍历{BinTree T=BT;while(T||!s.empty()){while(T){BinNode2 bn=new BinNode2(T,1);s.push(bn); T=T->left;}if(!s.empty()){BinNode temp=s.pop();if(temp.isfirst){temp.isfirst=0;s.push(temp);T=temp.btnode->right;}else{cout<<temp.btnode->data;T=NULL;}}}
}

void LevelOrderTraversal(Bintree BT) {Bintree T = BT;list<Bintree>l;l.push_back(T);while (!l.empty()) {*T = l.pop_front();cout << (*T).data;if (T->left) l.push_back(T->left);if (T->right)l.push_back(T->right);}
}