poj1988

/*
solution:
	并查集

note:
	注意每次调用getParent都要更新under数组。这是最容易出错的地方！
	由于路径的压缩，所以每次更新under时都相当与沿着路径更新。

date:
	2016.8.17
*/
#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
const int maxn = 30000+5;

int parent[maxn], under[maxn], sum[maxn];
int n, p;

int getParent(int a) {
	if(parent[a] == a)	return a;

	int t = getParent(parent[a]);
	under[a] += under[parent[a]];	//note
	parent[a] = t;
	return parent[a];
}

void Merge(int a, int b) {	//把a所在的堆放置到b所在的堆上面
	int pa = getParent(a);
	int pb = getParent(b);

	if(pa == pb)	return;
	parent[pb] = pa;
	under[pb] = sum[pa];
	sum[pa] += sum[pb];
}

int main()
{
	//freopen("input.txt", "r", stdin);
    while(~scanf("%d", &p)) {
		for(int i = 1; i <= 30000; i++) {
			parent[i] = i;
			under[i] = 0;
			sum[i] = 1;
		}

		char op[5];	int obj1, obj2;
		for(int i = 0; i < p; i++) {
			scanf("%s", op);
			if(op[0] == 'M') {
				scanf("%d%d", &obj1, &obj2);
				//printf("#%d %d\n", obj1, obj2);
				Merge(obj2, obj1);	//将obj1放在obj2上面
			}
			else {
				scanf("%d", &obj2);
				getParent(obj2);
				printf("%d\n", under[obj2]);
			}
		}
    }
    return 0;
}