#include <bits/stdc++.h>
using namespace std;
int n = 1;
int cnt = 0;
static vector<int> adj[200005];
static int low[200005];
static int high[200005];
static int XOR[200005];
void dfs(int u){
low[u] = cnt;
high[u] = cnt;
cnt++;
for(int v : adj[u]){
dfs(v);
high[u] = max(high[u], high[v]);
}
}
typedef pair<int,int> ii;
vector<ii> queries;
int N = 0;
static ii trie[4000005];
static set<int> S[4000005];
int CNT = 2;
void INS(int x, int pos){
int u = 1;
for(int b = 30;b >= 0;b--){
if((x & (1<<b)) == 0){
if(trie[u].first == 0){
trie[u].first = CNT;
CNT++;
}
u = trie[u].first;
}
else{
if(trie[u].second == 0){
trie[u].second = CNT;
CNT++;
}
u = trie[u].second;
}
S[u].insert(pos);
}
}
int main(){
//freopen("i.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
int Q; cin >> Q;
queries.push_back(ii(-1,0));
for(int q = 0;q < Q;q++){
string s; int a, b;
cin >> s >> a >> b;
if(s[0] == 'A' || s[0] == 'a'){
a--;
assert(a < n);
adj[a].push_back(n);
XOR[n] = XOR[a] ^ b;
queries.push_back(ii(-1,n));
n++;
}
else{
assert(a-1 < n);
assert(b-1 < n);
queries.push_back(ii(a-1,b-1));
}
}
dfs(0);
for(ii q : queries){
//cout << q.first << " " << q.second << "\n";
if(q.first == -1){
int pos = low[q.second];
int x = XOR[q.second];
INS(x, pos);
continue;
}
int other = XOR[q.first];
int L = low[q.second], R = high[q.second];
int cur = 0;
int u = 1;
for(int b = 30;b >= 0;b--){
int pref = trie[u].first;
int nopref = trie[u].second;
if(pref == 0){
cur ^= (1 << b);
u = nopref; continue;
}
if(nopref == 0){
u = pref; continue;
}
if((other & (1<<b)) == 0){
swap(pref, nopref);
cur ^= (1 << b);
}
if(Q <= 2000){
set<int> s = S[pref];
auto it = s.lower_bound(L);
if(it == s.end() || *it > R){
cur ^= (1 << b);
u = nopref;
}
else u = pref;
}
else u = pref;
}
cout << (cur ^ other) << "\n";
}
}
