#include<cstdio>
#include<iostream>
#include<algorithm>
#define N 100001
using namespace std;
int dep[N],son[N],fa[N],head[N],e_tot,tr_tot,bl[N],id[N],out[N],ans,sz,n;
struct edge{int to,next;}e[N];
struct node{int l,r,f,sum;}tr[N*2];
inline void add(int u,int v)
{e[++e_tot].to=v;e[e_tot].next=head[u];head[u]=e_tot;
}
void init()
{scanf("%d",&n);for(int i=1;i<n;i++) {scanf("%d",&fa[i]);add(fa[i],i);}
}
inline void build(int l,int r)
{tr_tot++;tr[tr_tot].l=l;tr[tr_tot].r=r;if(l==r) return;int mid=l+r>>1;build(l,mid);build(mid+1,r);
}
inline void dfs1(int x,int fa)
{son[x]++;for(int i=head[x];i;i=e[i].next){if(e[i].to==fa) continue;dep[e[i].to]=dep[x]+1;dfs1(e[i].to,x);son[x]+=son[e[i].to];}
}
inline void dfs2(int x,int chain)
{sz++;id[x]=sz;bl[x]=chain;int m=0;son[m]=-1;for(int i=head[x];i;i=e[i].next){if(e[i].to==fa[x]) continue;if(son[e[i].to]>son[m]) m=e[i].to;}if(!m) {out[x]=sz;return;}dfs2(m,chain);for(int i=head[x];i;i=e[i].next){if(e[i].to==fa[x] || e[i].to==m) continue;dfs2(e[i].to,e[i].to);}out[x]=sz;
}
inline void down(int k)
{int l=k+1,r=k+(tr[k+1].r-tr[k+1].l+1<<1);if(tr[k].f==1){tr[l].sum=tr[l].r-tr[l].l+1;tr[r].sum=tr[r].r-tr[r].l+1;}else{tr[l].sum=tr[r].sum=0;}tr[l].f=tr[r].f=tr[k].f;tr[k].f=0;
}
inline void change(int opl,int opr,int k,int w)
{if(tr[k].l==opl&&tr[k].r==opr){if(w==1){if(!tr[k].sum)  { tr[k].sum=opr-opl+1;ans+=tr[k].sum; }else if(tr[k].sum==tr[k].r-tr[k].l+1)  ans+=0;else {ans+=tr[k].r-tr[k].l+1-tr[k].sum;tr[k].sum=opr-opl+1;}}else{if(tr[k].sum==tr[k].r-tr[k].l+1) {ans+=tr[k].sum;tr[k].sum=0; }else if(!tr[k].sum) ans+=0;else{ans+=tr[k].sum;tr[k].sum=0;}}tr[k].f=w;return;    }if(tr[k].f!=0) down(k);int mid=tr[k].l+tr[k].r>>1,l=k+1,r=k+(tr[k+1].r-tr[k+1].l+1<<1);if(opr<=mid) change(opl,opr,l,w);else if(opl>mid) change(opl,opr,r,w);else {  change(opl,mid,l,w);  change(mid+1,opr,r,w);  }tr[k].sum=tr[l].sum+tr[r].sum;
}
inline void solve_change(int u,int v,int w)
{while(bl[u]!=bl[v]){if(id[bl[u]]<id[bl[v]]) swap(u,v);change(id[bl[u]],id[u],1,w);u=fa[bl[u]];}if(id[u]>id[v]) swap(u,v);change(id[u],id[v],1,w);
}
void solve()
{int p,x;char c[10];scanf("%d",&p);for(int i=1;i<=p;i++){ans=0;scanf("%s%d",c,&x);if(c[0]=='i') solve_change(0,x,1);else change(id[x],out[x],1,-1);printf("%d\n",ans);}
}
int main()
{init();build(1,n);dfs1(0,-1);dfs2(0,0);solve();
}