#include <bits/stdc++.h>

 using namespace std;

 #define ll long long

 #define mst(a,b) memset((a),(b),sizeof(a))

 #define pi acos(-1)

 #define pii pair<int,int>

 const int INF = 0x3f3f3f3f;

 const double eps = 1e-;

 const int MAXN = 1e5 + ;

 const int MAXM = 2e6 + ;

 const ll mod = 1e9 + ;

 int n;

 int num[MAXN],fa[MAXN],pre[MAXN],dep[MAXN];

 int ansl[MAXN],ansr[MAXN];

 int findd(int x) {

     if(pre[x] == x) return x;

     return pre[x] = findd(pre[x]);

 }

 void update(int u,int v) {

     int a = u, b = v;

     while(u != v) {

         if(dep[u] < dep[v]) swap(u,v);

         num[u]++;

         if(num[u] == )

             ansl[u] = min(a,b),ansr[u] = max(a,b);

         else

             pre[u] = fa[u];

         u = findd(fa[u]);

     }

 }

 int main()

 {

 #ifdef local

     freopen("data.txt","r",stdin);

 //    freopen("data.txt","w",stdout);

 #endif

     while(~scanf("%d",&n)) {

         mst(num,);

         for(int i=; i<n; i++) {

             int x;

             scanf("%d",&x);

             fa[i] = x;

             pre[i] = i;

             dep[i] = dep[x] + ;

         }

         int q;

         scanf("%d",&q);

         while(q--) {

             char s[];

             scanf("%s",s);

             if(s[] == 'R') {

                 int u,v;

                 scanf("%d%d",&u,&v);

                 update(u,v);

             }

             else {

                 int u;

                 scanf("%d",&u);

                 if(num[u] == ) puts("Not yet");

                 else if(num[u] == ) printf("%d %d\n",ansl[u],ansr[u]);

                 else puts("Many times");

             }

         }

     }

     return ;

 }