#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int N=2e5+5;
const int INF=2147483647;
inline int read(){int X=0,w=0;char ch=0;while(ch<'0'||ch>'9'){w|=ch=='-';ch=getchar();}while(ch>='0'&&ch<='9')X=(X<<3)+(X<<1)+(ch^48),ch=getchar();return w?-X:X;
}
struct node{int to,nxt;
}edge[2*N];
struct tree{int lazy,sum;
}t[4*N];
int head[N],cnt,tot,n;
inline void add(int u,int v){edge[++cnt].to=v;edge[cnt].nxt=head[u];head[u]=cnt;
}
int fa[N],dep[N],size[N],son[N],top[N],pos[N],idx[N];
void dfs1(int u){size[u]=1;for(int i=head[u];i;i=edge[i].nxt){int v=edge[i].to;if(v==fa[u])continue;fa[v]=u;dep[v]=dep[u]+1;dfs1(v);size[u]+=size[v];if(!son[u]||size[v]>size[son[u]])son[u]=v;}return;
}
void dfs2(int u,int anc){tot++;pos[u]=tot;idx[tot]=u;top[u]=anc;if(!son[u])return;dfs2(son[u],anc);for(int i=head[u];i;i=edge[i].nxt){int v=edge[i].to;if(v==fa[u]||v==son[u])continue;dfs2(v,v);}return;
}
inline void pushdown(int a,int l,int r){int mid=(l+r)>>1;if(t[a].lazy!=-1){t[a*2].lazy=t[a*2+1].lazy=t[a].lazy;t[a*2].sum=t[a].lazy*(mid-l+1);t[a*2+1].sum=t[a].lazy*(r-mid);t[a].lazy=-1;}return;
}
void modify(int a,int l,int r,int l1,int r1,int v){if(r1<l||r<l1)return;if(l1<=l&&r<=r1){t[a].sum=v*(r-l+1);t[a].lazy=v;return;}int mid=(l+r)>>1;pushdown(a,l,r);modify(a*2,l,mid,l1,r1,v);modify(a*2+1,mid+1,r,l1,r1,v);t[a].sum=t[a*2].sum+t[a*2+1].sum;return;
}
void pathmodify(int u,int v,int c){while(top[u]!=top[v]){if(dep[top[u]]<dep[top[v]]){int t=u;u=v;v=t;}modify(1,1,n,pos[top[u]],pos[u],c);u=fa[top[u]];}if(dep[u]>dep[v]){int t=u;u=v;v=t;}modify(1,1,n,pos[u],pos[v],c);return;
}
inline void nodemodify(int u,int c){modify(1,1,n,pos[u],pos[u]+size[u]-1,c);
}
int query(int a,int l,int r,int l1,int r1){//线段树区间和if(r1<l||l1>r)return 0;if(l1<=l&&r<=r1)return t[a].sum;int mid=(l+r)>>1;pushdown(a,l,r);return query(a*2,l,mid,l1,r1)+query(a*2+1,mid+1,r,l1,r1);
}
int pathquery(int u,int v){//询问(u,v)这条路径的和if(top[u]!=top[v]){if(dep[top[u]]<dep[top[v]]){int t=u;u=v;v=t;}return pos[u]-pos[top[u]]+1+pathquery(fa[top[u]],v)-query(1,1,n,pos[top[u]],pos[u]);}if(dep[u]>dep[v]){int t=u;u=v;v=t;}return pos[v]-pos[u]+1-query(1,1,n,pos[u],pos[v]);
}
inline int nodequery(int u){return query(1,1,n,pos[u],pos[u]+size[u]-1);
}
void init(){dep[1]=fa[1]=1;dfs1(1);top[1]=idx[1]=pos[1]=1;tot=0;dfs2(1,1);for(int i=1;i<4*n;i++)t[i].lazy=-1;return;
}
int main(){n=read();for(int i=2;i<=n;i++){int v=read()+1;add(i,v);add(v,i);}init();int q=read();while(q--){char op[20];scanf("%s",op);int u=read()+1;if(op[0]=='i'){printf("%d\n",pathquery(u,1));pathmodify(u,1,1);}else{printf("%d\n",nodequery(u));nodemodify(u,0);}}return 0;
}