#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define repd(i,x,y) for(regiser int i=x;i>=y;--i)
#define ll long long 
using namespace std;
const int N=1e5+7;
int f[N],rl[N],n,a,b,nm[N];
char c;

int (int x){
    if(f[x]==x)return x;
    int t=find(f[x]);
    rl[x]+=rl[f[x]];
    return f[x]=t;
}

inline void un(int x,int y){
    int a=find(x);
    int b=find(y);
    f[b]=a;
    rl[b]=nm[a];		
    nm[a]+=nm[b];		//更新b的长度 
    //nm[a]=0;			
}

int main(){
    ios::sync_with_stdio(false);
    cin>>n;
    rep(i,1,30000)f[i]=i,nm[i]=1;
    rep(i,1,n){
        cin>>c>>a;
        if(c=='M'){cin>>b;un(a,b);}
        else cout<<nm[find(a)]-rl[a]-1<<endl;
    }
    return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define repd(i,x,y) for(register int i=x;i>=y;--i)
#define ll long long
using namespace std;
const int N=1e5+7;
int f[N],dis[N],n,a,b;
char c;
int (int x){
    if(f[x]<0)return x;
    int t=find(f[x]);
    dis[x]+=dis[f[x]];
    return f[x]=t;
}

inline void un(int x,int y){
    x=find(x);
    y=find(y);
    if(x!=y){
        dis[y]=(-f[x]);
        f[x]+=f[y];
        f[y]=x;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin>>n;
    memset(f,-1,sizeof(f));
    rep(i,1,n){
        cin>>c>>a;
        if(c=='M'){cin>>b; un(a,b);}
        else cout<<f[find(a)]*(-1)-dis[a]-1<<endl;
    }
    return 0;
}