#include <bits/stdc++.h>
using namespace std;

const int maxn = 100001;
int n;

int adj[maxn], visited[maxn],ans;
vector<int> radj[maxn];

void dfs(int k){
    visited[k] = 1;
    ans++;
    if(k == 0)return;
    if(!visited[adj[k]])dfs(adj[k]);
}
void rdfs(int k){
    visited[k] = 0;
    ans++;
    for(auto x:radj[k]){
        //cerr << x << " ";
        if(visited[x])rdfs(x);
    }
    //cerr << endl;
}

int main(){

    //freopen("manager.in", "r", stdin);
    //freopen("manager.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i=1;i<=n-1;i++){
        cin >> adj[i];
        radj[adj[i]].push_back(i);
    }
    memset(visited,0,sizeof(visited));

    int q, node; cin >> q;
    string comm;
    while(q--){
        cin >> comm >> node;
        ans=0;
        if(comm == "install"){
            if(!visited[node])dfs(node);
        }else if(comm == "uninstall"){
            if(visited[node])rdfs(node);
        }
        cout << ans << "\n";
    }
}