uva12096

/*
ID: Ben biss
PROG: #####
LANG: C++
*/
#include<stdio.h>
#include <iostream>
using namespace std;
#include<cstring>
#include<sstream>
#include <fstream>
#include<set>
#include<cmath>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define FOR(i,n) for(i=0;i<n;i++)
#define cmem(a) memset(a,'/0',sizeof(a))
#define imem(a) memset(a,0,sizeof(a))
//#define cin fin
//#define cout fout

typedef set<int> Set;
map<Set,int>my_map;
vector<Set>IDCH;
stack<int>s;

int ID(Set x)//将集合转变成ID
{
if(my_map.count(x))return my_map[x];
IDCH.push_back(x);
return my_map[x]=IDCH.size()-1;
}
//定义宏，方便使用下面的函数
#define All(x) x.begin() , x.end()
#define INS(x) inserter(x,x.begin())//生成新的迭代器

int main()
{
//ofstream fout ("#####.out");
//ifstream fin ("#####.in");
int cases,flag=0,num;
string str;
cin>>cases;
while(cases--)
{
if(flag++)printf("***\n");
cin>>num;
while(num--)
{
cin>>str;
if(str[0]=='P')s.push(ID(Set()));//创建一个空集合，作为参数传递，http://www.cplusplus.com/reference/set/set/set/
else if(str[0]=='D')s.push(s.top());
else
{
Set x1=IDCH[s.top()];s.pop();
Set x2=IDCH[s.top()];s.pop();
Set x;
if(str[0]=='U')set_union(All(x1),All(x2),INS(x));//这些函数，在我的博客里面有
if(str[0]=='I')set_intersection(All(x1),All(x2),INS(x));
if(str[0]=='A'){x=x2;x.insert(ID(x1));}
s.push(ID(x));
}
cout<<IDCH[s.top()].size()<<endl;
}
}

return 0;
}