#include<cstdio>
#include<iostream>
#include<algorithm>
#include<set>
#include<stack>
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin());
using namespace std;
const int maxn=10010;
const int N=10;
typedef set<int> set;
vector<set> Setcache;
map<set,int> IDcache;
//查找给定集合x的ID 如果找不到,分配一个新的ID
int ID(set x){
if(IDcache[x].count) return IDcache[x];
Setcache.push_back(x);
return IDcache[x]=Setcache.size()-1;
}
int main(){
int n;
stack<int> s;
cin>>n;
while(n--){
string op;
cin>>op;
if(op[0]=='P') s.push(ID(set()))
else if(op[0]=='D') s.push(s.top());
else{
set x1=Setcache[s.top()]; s.pop();
set x2=Setcache[s.top()]; s.pop();
set x;
if(op[0]=='U') set_union(ALL(x1),ALL(x2),INS(x));
if(op[0]=='I') set_intersection(ALL(x1),ALL(x2),INS(x));
if(op[0]=='A') {
x=x2; x.insert(ID(x1));
}
s.push(ID(x));
}
printf("%d\n",Setcache[s.top()].size());
}
return 0;
}