#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define getar(ar,n) for(int i=0;i<n;++i) cin>>ar[i]
#define show(n) cout<<n<<'\n'
#define all(v) v.begin(), v.end()
#define br cout<<"\n"
#define pb push_back
#define nl '\n'
#define fi first
#define se second
const int mxN = 2e5 + 500;
int N=1,idx=-1,parent[mxN],depth[mxN],heavy[mxN],head[mxN],sz[mxN],tin[mxN],tout[mxN],seg[mxN*4],val[mxN],till[mxN];
vector<pair<int,int>> adj[mxN];
struct Node {
Node* children[2];
pbds st;
Node(){
for(int i=0;i<2;++i){
children[i]=NULL;
}
}
};
struct Trie{
Node* root = new Node();
void add(int x,int t){
Node* curr=root;
for(int i=30;i>=0;--i){
int curr_bit=(x&(1ll<<i))>0;
if(curr->children[curr_bit]==NULL){
curr->children[curr_bit]=new Node();
}
curr=curr->children[curr_bit];
curr->st.insert(t);
}
}
int qry(int x,int st,int en){
Node* curr=root;
int ans=0;
for(int i=30;i>=0;--i){
int curr_bit=((x&(1ll<<i))>0);
if(curr->children[!curr_bit]!=NULL){
if(curr->children[!curr_bit]->st.order_of_key(en+1)-curr->children[!curr_bit]->st.order_of_key(st)>=1){
ans|=(1ll<<i);
curr=curr->children[!curr_bit];
}else{
curr=curr->children[curr_bit];
}
}else curr=curr->children[curr_bit];
if(curr==NULL) return ans;
}
return ans;
}
} t;
struct Seg {
void update_1(int node,int start,int end,int idx,int val){
if(start==end){
seg[node]=val;
return;
}
int mid=start+(end-start)/2;
if(idx<=mid) update_1(node*2+1,start,mid,idx,val);
else update_1(node*2+2,mid+1,end,idx,val);
seg[node]=seg[node*2+1]^seg[node*2+2];
}
int xor_qry(int node,int start,int end,int l,int r){
if(start>r||end<l) return 0;
if(start>=l&&end<=r) return seg[node];
int mid=start+(end-start)/2;
return xor_qry(node*2+1,start,mid,l,r)^xor_qry(node*2+2,mid+1,end,l,r);
}
} seg_tree;
struct HLD {
void dfs(int u=1,int par=0){
sz[u]=1;
parent[u]=par;
depth[u]=depth[par]+1;
for(auto it:adj[u]){
dfs(it.fi,u);
val[it.fi]=it.se;
sz[u]+=sz[it.fi];
if(sz[heavy[u]]<sz[it.fi]) heavy[u]=it.fi;
}
}
void dfsHLD(int u=1,int chain=1){
head[u]=chain;
tin[u]=++idx;
seg_tree.update_1(0,0,N-1,tin[u],val[u]);
if(heavy[u]!=0) dfsHLD(heavy[u],chain);
for(auto it:adj[u]){
if(it.fi!=heavy[u]) dfsHLD(it.fi,it.fi);
}
tout[u]=idx;
}
int qry(int u,int v){
int ans=0;
while(head[u]!=head[v]){
if(depth[head[u]]<depth[head[v]]) swap(u,v);
ans=ans^seg_tree.xor_qry(0,0,N-1,tin[head[u]],tin[u]);
u=parent[head[u]];
}
if(depth[u]<depth[v]) swap(u,v);
return (ans^seg_tree.xor_qry(0,0,N-1,tin[v],tin[u]))^val[v];
}
} hld;
void lets_go() {
int q,u,v;cin>>q;
string type;
vector<vector<int>> Q; // 1-> add ,0-> query
for(int i=0;i<q;++i){
cin>>type>>u>>v;
if(type=="Add"){
Q.pb({1,u,++N,v});
adj[u].pb({N,v});
}else{
Q.pb({0,u,v});
}
}
hld.dfs();
hld.dfsHLD();
for(auto it:Q){
if(it[0]==1){
till[it[2]]=till[it[1]]^it[3];
t.add(till[it[2]],tin[it[2]]);
// t.add(0,tin[it[2]]);
}else{
u=it[1],v=it[2];
show(t.qry(hld.qry(u,v)^till[v],tin[v],tout[v]));
//show(hld.qry(u,v));
}
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
lets_go();
return 0;
}
