#include <stdio.h> int b[30003],count[30003],f[30003]; int find(int i) { int x=i,p,s=0; while(x!=f[x]){ x=f[x]; s+=b[x]; } while(i!=x){ b[i]+=s; p=f[i]; f[i]=x; s-=b[p]; i=p; } return x; } void merge(int i,int j) { int fi,fj; fi=find(i); fj=find(j); f[fj]=fi; b[fj]+=count[fi]; count[fi]+=count[fj]; } int search(int i) { int fi; fi=find(i); return count[fi]-b[i]-1; } int main() { int i,n,p,q; char c; for(i=0;i<30003;i++){ f[i]=i; count[i]=1; b[i]=0; } scanf("%d",&n); getchar(); while(n--){ scanf("%c ",&c); if(c=='M'){ scanf("%d %d",&p,&q); getchar(); merge(p,q); } else{ scanf("%d",&p); getchar(); printf("%d/n",search(p)); } } return 0; }