#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (PPCM)
// HERE IS THE SOLUTION
const int N = 2000;
vector<vii> adj(N + 1);
int k;
set<int> v;
bool ins = 0;
bool quit = 0;
int path = 0 , best = 0;
void dfs(int i , int par)
{
if(quit)return;
if(i == k)
{
ins = 1;
}
if(ins)
v.insert(i);
for(auto u : adj[i])
{
if(u.fi == par)continue;
dfs(u.fi , i);
}
if(i == k)
quit = 1;
}
void dfs1(int i , int par)
{
for(auto u : adj[i])
{
if(u.fi == par)continue;
path^=u.se;
if(v.count(u.fi))
best = max(best , path);
dfs1(u.fi , i);
path^=u.se;
}
}
int query(int a , int b)
{
v.clear();
quit = 0 , ins = 0;
k = b;
dfs(0 , -1);
path = 0 , best = 0;
dfs1(a , -1);
return best;
}
int main()
{
cin.tie(0);
cout.tie(0);
boost;
// freopen("inp.txt" , "r" , stdin);
int q;
cin>>q;
int cnt = 0;
while(q--)
{
string s;
cin>>s;
int x , y;
cin>>x>>y;
x--;
if(s == "Add")
{
adj[x].pb({cnt + 1 , y});
adj[cnt + 1].pb({x , y});
cnt++;
}
else
{
y--;
cout<<query(x , y)<<nl;
}
}
}
