#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
#define maxn 300100
int n,fa[maxn],num[maxn],under[maxn];
char s[5];
int find(int x)
{
      if(x==fa[x])
            return x;
      int k=fa[x];
      fa[x]=find(fa[x]);
      under[x]+=under[k];
      return fa[x];
}
void Union(int x,int y)
{
      int fx,fy;
      fx=find(x),fy=find(y);
      if(fx!=fy)
      {
            under[fx]=num[fy];
            num[fy]+=num[fx];
            fa[fx]=fy;
      }
}
int main()
{
      int x,y;
      while(scanf("%d",&n)!=EOF)
      {
            for(int i=0;i<=n;i++)
                  fa[i]=i,num[i]=1,under[i]=0;
            for(int i=0;i<n;i++)
            {
                scanf("%s",s);
                if(s[0]==‘M‘)
                {
                      scanf("%d%d",&x,&y);
                      Union(x,y);
                }
                else if(s[0]==‘C‘)
                {
                      scanf("%d",&x);
                      find(x);
                      printf("%d\n",under[x]);
                }
            }
      }
      return 0;
}