#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn=100000+5;

int n,q;
int dep[maxn];
int prt[maxn];
int size[maxn];
int son[maxn];
int top[maxn];
int tid[maxn];
int rev_tid[maxn];
int r[maxn];

struct Edge{
    int head[maxn];
    struct edge{
        int to,next;
        edge(){}
        edge(int a,int b):to(a),next(b){}
    }g[maxn];

    void insert(int from,int to,int id){
        g[id]=edge(to,head[from]);
        head[from]=id;
    }
}G;

struct Segment_Tree{
    struct node{
        int l,r,x,s;
    }a[4*maxn];
    
    void build_tree(int l,int r,int k){
        a[k].l=l; a[k].r=r; a[k].x=0; a[k].s=0;
        if(l==r) return;
        int mid=l+(r-l)/2;
        build_tree(l,mid,2*k); build_tree(mid+1,r,2*k+1);
    }
    
    inline void push_down(int k)
    {
        if(a[k].s!=-1){
            a[2*k].s=a[k].s; a[2*k].x=a[k].s?a[2*k].r-a[2*k].l+1:0;
            a[2*k+1].s=a[k].s; a[2*k+1].x=a[k].s?a[2*k+1].r-a[2*k+1].l+1:0;
        }
    }
    
    inline void push_up(int k)
    {
        a[k].x=a[2*k].x+a[2*k+1].x;
        a[k].s=(a[2*k].s==a[2*k+1].s&&a[2*k].s!=-1)?a[2*k].s:-1;
    }
    
    int search(int l,int r,int k,int t){
        if(a[k].l==l&&a[k].r==r){
            int ans=t?a[k].x:r-l+1-a[k].x;
            a[k].s=t?0:1;
            a[k].x=t?0:r-l+1;
            return ans;
        }
        int mid=a[k].l+(a[k].r-a[k].l)/2;
        push_down(k);
        int ans;
        if(r<=mid) ans=search(l,r,2*k,t);
        else if(l>mid) ans=search(l,r,2*k+1,t);
        else ans=search(l,mid,2*k,t)+search(mid+1,r,2*k+1,t);
        push_up(k);
        return ans;
    }
}T;
            

void find_h_e(int u,int p,int d){
    prt[u]=p; dep[u]=d; size[u]=1;
    int max_size=0;
    for(int i=G.head[u];i;i=G.g[i].next){
        int v=G.g[i].to;
        find_h_e(v,u,d+1);
        size[u]+=size[v];
        if(size[v]>max_size){
            max_size=size[v];
            son[u]=v;
        }
    }
}

void conect_h_e(int u,int anc,int &k){
    top[u]=anc; tid[u]=++k; rev_tid[k]=u;
    if(son[u]) conect_h_e(son[u],anc,k);
    for(int i=G.head[u];i;i=G.g[i].next){
        int v=G.g[i].to;
        if(v!=son[u]){
            conect_h_e(v,v,k);
        }
    }
    r[u]=rev_tid[k];
}

int get_sum1(int u){
    int sum_now=0;
    while(top[u]!=0){
        sum_now+=T.search(tid[top[u]],tid[u],1,0);    
        u=prt[top[u]];
    }
    sum_now+=T.search(1,tid[u],1,0);
    return sum_now;
}

int get_sum2(int u){return T.search(tid[u],tid[r[u]],1,1);}

void solve(){
    scanf("%d",&q);
    for(int i=1;i<=q;i++){
        char c[15]; scanf("%s",c);
        int u; scanf("%d",&u);
        if(c[0]==‘i‘) printf("%d\n",get_sum1(u));
        else printf("%d\n",get_sum2(u));
        
    }
}

void init(){
    scanf("%d",&n);
    for(int i=1;i<n;i++){
        int from;
        scanf("%d",&from);
        G.insert(from,i,i);
    }
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("3.in","r",stdin);
    freopen("3.out","w",stdout);
#endif
    init();
    find_h_e(0,0,0);
    int k=0;
    conect_h_e(0,0,k);
    T.build_tree(1,n,1);
    solve();
#ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
    system("3.out");
#endif
    return 0;
}