#include<stdio.h>
#define N 200055
int nq,n,hd[N],fa[N],nxt[N+N],vv_[N+N],ii,jj=1,dfn[N],out[N],dfc,ii_,dp[N];
void Lnk(int u,int v){int i=++ii;nxt[i]=hd[u];vv_[i]=v;hd[u]=i;}
void dfs(int u,int p){
dfn[u]=dfc++;
for(int j=hd[u];j;j=nxt[j])if(vv_[j]-p)dfs(vv_[j],u);
out[u]=dfc;
}
struct QQ{char op[5];int a,b;}q[N];
struct{int lc,rc;}trie[N*400];
int tt[N],vv[99],ww[99],oo,mode;
void trieins(int&v,int val,int i){
if(!v)v=++ii_;
if(i==-1)return;
trieins((val>>i)%2?trie[v].rc:trie[v].lc,val,i-1);
}
unsigned trieqry(int val,int i){
if(i==-1)return 0;
int want=((val>>i)&1)^1,cnt=0;
for(int i=0;i<oo;++i)cnt+=(want?!!trie[vv[i]].rc:!!trie[vv[i]].lc)*ww[i];
if(!cnt){
for(int i=0;i<oo;++i){
vv[i]=want?trie[vv[i]].lc:trie[vv[i]].rc;
}
return trieqry(val,i-1);
}else{
for(int i=0;i<oo;++i)vv[i]=want?trie[vv[i]].rc:trie[vv[i]].lc;
return (1u<<i)^trieqry(val,i-1);
}
}
void INS(int p,int k){
for(;p<n;p|=p+1)trieins(tt[p],k,30);
}
void GEN(int p){
for(;p>0;p&=p-1)vv[oo]=tt[p-1],ww[oo]=mode,++oo;
}
int main(){
scanf("%d",&nq);
for(int i=0;i<nq;++i){
scanf("%s%d%d",q[i].op,&q[i].a,&q[i].b);
if(q[i].op[0]=='A'){
fa[++jj]=q[i].a;
dp[jj]=dp[fa[jj]]^q[i].b;
Lnk(fa[jj],jj);
q[i].a=jj;
}
}
n=jj;
dfs(1,1);
INS(0,0);
for(int i=0;i<nq;++i){
if(q[i].op[0]=='A'){
//printf(" Turn on %d at %d\n",dp[q[i].a],dfn[q[i].a]);
INS(dfn[q[i].a],dp[q[i].a]);
}else{
oo=0;mode=1;GEN(out[q[i].b]);mode=-1;GEN(dfn[q[i].b]);
//printf(" Qry %d on %d %d\n",dp[q[i].a],dfn[q[i].b],out[q[i].b]);
printf("%u\n",trieqry(dp[q[i].a],30));
}
}
return 0;
}
