#include <bits/stdc++.h>
#define Alora "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define all(v) v.begin(), v.end()
#define pb push_back
#define maxn 200050
const int M = 1e9 + 7;
using namespace std;
int Q, n, m, a[maxn];
vector <int> g[maxn];
struct dl{int x, y, time;}b[maxn];
int in[maxn], out[maxn], tmp;
void dfs(int u){
in[u] = ++tmp;
for(auto v: g[u]) dfs(v);
out[u] = tmp;
}
int xd[maxn][3], cnt;
set <int> st[maxn];
void add(int num, int time){
int tt = 0;
fid(i, 30, 0){
int c = getbit(num, i);
if(xd[tt][c] == 0) xd[tt][c] = ++cnt;
tt = xd[tt][c];
st[tt].insert(time);
}
}
bool check(int tt, int l, int r){
if(tt == 0) return 0;
auto it = st[tt].lower_bound(l);
if(it == st[tt].end()) return 0;
return (*it <= r) ;
}
int get(int l, int r, int num){
int tt = 0, ans = 0;
fid(i, 30, 0){
int c = getbit(num, i);
if(check(xd[tt][1 - c], l, r)){
ans += (1 << i);
tt = xd[tt][1 - c];
}
else tt = xd[tt][c];
}
return ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
if(fopen(Alora".inp", "r")){
freopen(Alora".inp", "r", stdin);
freopen(Alora".out", "w", stdout);}
cin >> Q;
n = 1;
fi(i, 1, Q){
string s; int x, y;
cin >> s >> x >> y;
if(s == "Add"){
a[++n] = a[x] ^ y;
g[x].pb(n);
b[i] = {0, n, n};
}
else b[i] = {1, x, y};
}
dfs(1);
add(0, 1);
fi(i, 1, Q){
auto[t, x, y] = b[i];
if(t == 0) add(a[x], in[x]);
else{
cout << get(in[y], out[y], a[x]) << '\n';
}
}
return 0;
}
