Problem: Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher.

Danil works in a rooted tree (undirected connected acyclic graph) with n vertices, vertex 1 is the root of the tree. There is a room in each vertex, light can be switched on or off in each room. Danil's duties include switching light in all rooms of the subtree of the vertex. It means that if light is switched on in some room of the subtree, he should switch it off. Otherwise, he should switch it on.

Unfortunately (or fortunately), Danil is very lazy. He knows that his boss is not going to personally check the work. Instead, he will send Danil tasks using Workforces personal messages.

There are two types of tasks: 

  1. pow v describes a task to switch lights in the subtree of vertex v.
  2. get v describes a task to count the number of rooms in the subtree of v, in which the light is turned on. Danil should send the answer to his boss using Workforces messages.



A subtree of vertex v is a set of vertices for which the shortest path from them to the root passes through v. In particular, the vertex v is in the subtree of v.

Danil is not going to perform his duties. He asks you to write a program, which answers the boss instead of him.

Input

The first line contains a single integer n (1 ≤ n ≤ 200 000) — the number of vertices in the tree.

The second line contains n - 1 space-separated integers p2, p3, ..., pn (1 ≤ pi < i), where pi is the ancestor of vertex i.

The third line contains n space-separated integers t1, t2, ..., tn (0 ≤ ti ≤ 1), where ti is 1, if the light is turned on in vertex i and 0 otherwise.

The fourth line contains a single integer q (1 ≤ q ≤ 200 000) — the number of tasks.

The next q lines are get v or pow v (1 ≤ v ≤ n) — the tasks described above.

Output

For each task get v print the number of rooms in the subtree of v, in which the light is turned on.

Example

Input

4
1 1 1
1 0 0 1
9
get 1
get 2
get 3
get 4
pow 1
get 1
get 2
get 3
get 4


Output

2
0
0
1
2
1
1
0

Note

<image> The tree before the task pow 1.

<image> The tree after the task pow 1.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Main {

    private static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException exp) {
                    throw new RuntimeException(exp);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }
    }

    public static void main(String[] args) {    //throws FileNotFoundException {
        InputStream inputStream = System.in;    //new FileInputStream("input.txt");
        OutputStream outputStream = System.out; //new FileOutputStream("output.txt");
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);

        Task newTask = new Task();
        newTask.solve(in, out);

        out.close();
    }

    private static class Task {
        //.constant
        private final int INF = Integer.MAX_VALUE;
        private final int MOD = (int)1e9 + 7;

        //.data
        private class SegmentTree {
            
            private class Node {
                public int cntOn;
                public boolean isTerm;
                public int l;
                public int r;

                public Node() {
                    cntOn = 0;
                    isTerm = false;
                    l = -1;
                    r = -1;
                }
            }

            public SegmentTree(int[] currentStatus, int len) {
                tree = new ArrayList<>();
                n = len - 1;
                initData = currentStatus;
                root = 0;
                tree.add(new Node());
                build(root, 0, n);
            }

            private void build(int v, int l, int r) {
                if (l == r) {
                    tree.get(v).cntOn = initData[l];
                    return;
                }

                int mid = (l + r) >> 1;

                tree.get(v).l = tree.size();
                tree.add(new Node());
                build(tree.get(v).l, l, mid);

                tree.get(v).r = tree.size();
                tree.add(new Node());
                build(tree.get(v).r, mid + 1, r);

                updateVertex(v);
            }

            private void updateVertex(int v) {
                tree.get(v).cntOn = tree.get(tree.get(v).l).cntOn + tree.get(tree.get(v).r).cntOn;
            }

            public int get(int l, int r) {
                return get(root, 0, n, l, r);
            }

            private int get(int v, int lb, int rb, int l, int r) {
                if (l > r) {
                    return 0;
                }

                if (lb == l && r == rb) {
                    return tree.get(v).cntOn;
                }

                int mid = (lb + rb) >> 1;
                pushDown(v, lb, rb);
                return get(tree.get(v).l, lb, mid, l, Math.min(mid, r)) +
                        get(tree.get(v).r, mid + 1, rb, Math.max(mid + 1, l), r);
            }

            private void update(int v, int lb, int rb, int l, int r) {
                if (l > r) {
                    return;
                }

                pushDown(v, lb, rb);

                if (lb == l && r == rb) {
                    tree.get(v).isTerm = !tree.get(v).isTerm;
                    tree.get(v).cntOn = r - l + 1 - tree.get(v).cntOn;
                    return;
                }

                int mid = (lb + rb) >> 1;
                update(tree.get(v).l, lb, mid, l, Math.min(mid, r));
                update(tree.get(v).r, mid + 1, rb, Math.max(l, mid + 1), r);

                updateVertex(v);
            }

            private void pushDown(int v, int l, int r) {
                if (tree.get(v).isTerm && tree.get(v).l != -1) {
                    int mid = (l + r) >> 1;

                    tree.get(tree.get(v).l).isTerm = !tree.get(tree.get(v).l).isTerm;
                    tree.get(tree.get(v).l).cntOn = mid - l + 1 - tree.get(tree.get(v).l).cntOn;

                    tree.get(tree.get(v).r).isTerm = !tree.get(tree.get(v).r).isTerm;
                    tree.get(tree.get(v).r).cntOn = r - mid - tree.get(tree.get(v).r).cntOn;

                    tree.get(v).isTerm = false;

                    updateVertex(v);
                }
            }

            public void update(int l, int r) {
                update(root, 0, n, l, r);
            }
            
            private ArrayList<Node> tree;
            private int n;
            private int root;
            private int[] initData;
        }

        private final int SIZE = 200001;
        private ArrayList<ArrayList<Integer>> gr = new ArrayList<>(SIZE);
        private int[] t = new int[SIZE];
        private int[] tIn = new int [SIZE];
        private int[] tOut = new int[SIZE];
        private int[] orderT = new int[SIZE];
        private int T = 0;

        private void dfs(int from) {
            orderT[T] = t[from];
            tIn[from] = T++;
            for (int to : gr.get(from)) {
                dfs(to);
            }
            tOut[from] = T - 1;
        }

        //.code
        public void solve(InputReader in, PrintWriter out) {
            int n = in.nextInt();
            for (int i = 0; i < n; ++i) {
                gr.add(new ArrayList<>());
            }
            for (int i = 1; i < n; ++i) {
                gr.get(in.nextInt() - 1).add(i);
            }
            for (int i = 0; i < n; ++i) {
                t[i] = in.nextInt();
            }

            dfs(0);

            SegmentTree st = new SegmentTree(orderT, n);

            int q = in.nextInt();
            for (int i = 0; i < q; ++i) {
                char cmd = in.next().charAt(0);
                int v = in.nextInt() - 1;

                if (cmd == 'g') {
                    out.println(st.get(tIn[v], tOut[v]));
                } else {
                    st.update(tIn[v], tOut[v]);
                }
            }

        }//end

    }

}