#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<stack>
#include<set>
#include<map>
using namespace std;
map<set<int>,int>to;
map<int,set<int>>back;
stack<int>sk;
int cnt;
int get(set<int> st){
	if(!to.count(st)){
		cnt++;
		to[st]=cnt;
		back[cnt]=st;
	}
	return to[st];
}
int main(){
	short t;
	scanf("%d",&t);
	while(t--){
		while(!sk.empty())
			sk.pop();
		string s;
		int n;
		scanf("%d",&n);
		while(n--){
			cin>>s;
			if(s[0]=='P')
				sk.emplace(get(set<int>()));
			if(s[0]=='D')
				sk.emplace(sk.top());
			if(s[0]=='U'){
				set<int> t1=back[sk.top()];
				sk.pop();
				set<int> t2=back[sk.top()];
				sk.pop();
				set<int> ans;
				set_union(t1.begin(),t1.end(),t2.begin(),t2.end(),inserter(ans,ans.end()));
				sk.emplace(get(ans));
			}
			if(s[0]=='I'){
				set<int> t1=back[sk.top()];
				sk.pop();
				set<int> t2=back[sk.top()];
				sk.pop();
				set<int> ans;
				set_intersection(t1.begin(),t1.end(),t2.begin(),t2.end(),inserter(ans,ans.end()));
				sk.emplace(get(ans));
			}
			if(s[0]=='A'){
				set<int> t1=back[sk.top()];
				sk.pop();
				set<int> t2=back[sk.top()];
				sk.pop();
				t1.emplace(get(t2));
				sk.emplace(get(t1));
			}
			printf("%d\n",back[sk.top()].size());
		}
		puts("***");
	}
	return 0;
}