//Writed by: Jethro_
//----------------------
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int N = 4e6 + 10;
int n, node = 1, i, root, val, in[N], out[N], cnt = 0, Xor[N], LG = 31, child[N][2], cnt2 = 0;
vector<pair<int, int>> a[N];
set<int> save[N];
pair<int, int> query[N];
string type[N];
void add() {
cin >> n;
for(i = 1; i <= n; ++i) {
cin >> type[i];
if(type[i] == "Add") {
cin >> root >> val;
a[++node].push_back({root, val});
a[root].push_back({node, val});
query[i] = {node, node};
}else {
cin >> root >> val;
query[i] = {root, val};
}
}
}
void dfs(int u, int p) {
in[u] = ++cnt;
for(auto [v, w] : a[u]) {
if(v == p) continue;
Xor[v] = Xor[u] ^ w;
dfs(v, u);
}
out[u] = cnt;
}
void ADD(int s, int id) {
int u = 0;
for(int i = LG; i >= 0; --i) {
int k = (s >> i) & 1;
if(child[u][k] == -1) {
child[u][k] = ++cnt2;
}
u = child[u][k];
save[u].insert(in[id]);
}
}
void get(int s, int l, int r) {
int u = 0, res = 0;
for(int i = LG; i >= 0; --i) {
int k = (s >> i) & 1, t = child[u][k ^ 1];
if(t != -1){
auto x = save[t].lower_bound(l);
if(x != save[t].end() && (*x) <= r) {
u = t;
res += (1 << i);
}else {
u = child[u][k];
}
}else {
u = child[u][k];
}
}
cout << res << '\n';
}
void solve() {
memset(child, -1, sizeof child);
dfs(1, 0);
ADD(0, 1);
for(i = 1; i <= n; ++i) {
auto [x, y] = query[i];
if(type[i] == "Add") {
ADD(Xor[x], y);
}else {
int now = Xor[x];
get(now, in[y], out[y]);
}
}
}
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
add();
solve();
}
