#include <vector>

#include <cstdio>

#define N 100005

using namespace std;

vector<int>G[N];

int n,q,tim,siz[N],fa[N],dep[N],belong[N],top[N];

struct Segment

{

    int l,r,mid,sum,flag;

    Segment *ch[];

    Segment()

    {

        ch[]=ch[]=NULL;

        sum=flag=;

    }

}*root=new Segment;

void dfs1(int x)

{

    siz[x]=;

    dep[x]=dep[fa[x]]+;

    for(int i=;i<G[x].size();++i)

    {

        int v=G[x][i];

        if(fa[x]!=v)

        {

            fa[v]=x;

            dfs1(v);

            siz[x]+=siz[v];

        }

    }

}

void dfs2(int x)

{

    if(!top[x]) top[x]=x;

    int t=;

    belong[x]=++tim;

    for(int i=;i<G[x].size();++i)

    {

        int v=G[x][i];

        if(fa[x]!=v&&siz[t]<siz[v]) t=v;

    }

    if(t) top[t]=top[x],dfs2(t);

    for(int i=;i<G[x].size();++i)

    {

        int v=G[x][i];

        if(fa[x]!=v&&v!=t) dfs2(v);

    }

}

inline void pushup(Segment *&k) {k->sum=k->ch[]->sum+k->ch[]->sum;}

void build(Segment *&k,int l,int r)

{

    k=new Segment;

    k->l=l;k->r=r;

    if(l==r) return;

    k->mid=(l+r)>>;

    build(k->ch[],l,k->mid);

    build(k->ch[],k->mid+,r);

    pushup(k);

}

void swap(int &m,int &n)

{

    int tmp=n;

    n=m;

    m=tmp;

}

void pushdown(Segment *&k)

{

    if(k->flag==)

    {

        k->ch[]->flag=k->flag;

        k->ch[]->sum=k->ch[]->r-k->ch[]->l+;

        k->ch[]->flag=k->flag;

        k->ch[]->sum=k->ch[]->r-k->ch[]->l+;

        k->flag=;

    }

    else

    {

        k->ch[]->flag=k->flag;

        k->ch[]->sum=;

        k->ch[]->flag=k->flag;

        k->ch[]->sum=;

        k->flag=;

    }

}

int Tree_Query(Segment *&k,int l,int r)

{

    if(k->l==l&&k->r==r) return k->sum;

    if(k->flag) pushdown(k);

    if(l>k->mid) return Tree_Query(k->ch[],l,r);

    else if(r<=k->mid) return Tree_Query(k->ch[],l,r);

    else return Tree_Query(k->ch[],l,k->mid)+Tree_Query(k->ch[],k->mid+,r);

    pushup(k);

}

void Tree_Change(Segment *&k,int l,int r,int opt)

{

    if(k->l==l&&k->r==r)

    {

        k->flag=opt;

        if(opt==) k->sum=r-l+;

        else k->sum=;

        return;

    }

    if(k->flag) pushdown(k);

    if(l>k->mid) Tree_Change(k->ch[],l,r,opt);

    else if(r<=k->mid) Tree_Change(k->ch[],l,r,opt);

    else Tree_Change(k->ch[],l,k->mid,opt),Tree_Change(k->ch[],k->mid+,r,opt);

    pushup(k);

}

int Chain_Query(int x,int y)

{

    int ret=;

    for(;top[x]!=top[y];x=fa[top[x]])

    {

        if(dep[top[x]]<dep[top[y]]) swap(x,y);

        ret+=Tree_Query(root,belong[top[x]],belong[x]);

    }

    if(dep[x]<dep[y]) swap(x,y);

    ret+=Tree_Query(root,belong[y],belong[x]);

    return ret;

}

void Chain_Change(int x,int y,int opt)

{

    for(;top[x]!=top[y];x=fa[top[x]])

    {

        if(dep[top[x]]<dep[top[y]]) swap(x,y);

        Tree_Change(root,belong[top[x]],belong[x],opt);

    }

    if(dep[x]<dep[y]) swap(x,y);

    Tree_Change(root,belong[y],belong[x],opt);

}

int Main()

{

    scanf("%d",&n);

    for(int pr,i=;i<=n;++i)

    {

        scanf("%d",&pr);

        G[++pr].push_back(i);

        G[i].push_back(pr);

    }

    dfs1();

    dfs2();

    build(root,,n);

    scanf("%d",&q);

    char opt[];

    for(int x;q--;)

    {

        scanf("%s%d",opt,&x);++x;

        if(opt[]=='i')

        {

            int ans=Chain_Query(,x);

            Chain_Change(,x,);

            printf("%d\n",dep[x]-ans);

        }

        else

        {

            int ans=Tree_Query(root,belong[x],belong[x]+siz[x]-);

            Tree_Change(root,belong[x],belong[x]+siz[x]-,);

            printf("%d\n",ans);

        }

    }

    return ;

}

int sb=Main();

int main(int argc,char *argv[]) {;}