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.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;


public class E877 {
	
	class Node {
		int l, r;
		int sum;
		boolean delta;
		Node left, right;
		void init(int ll, int rr, int[] a) {
			l = ll;
			r = rr;
			if(l == r) {
				sum = a[ll];
				return;
			}
			int m = l + r >> 1;
			left = new Node();
			right = new Node();
			left.init(ll, m, a);
			right.init(m + 1, rr, a);
			sum = left.sum + right.sum;
		}
		void set() {
			sum = (r - l + 1) - sum;
		}
		void push() {
			if(!delta) return;
			delta = false;
			left.delta = !left.delta;
			right.delta = !right.delta;
			left.set();
			right.set();
		}
		int query(int ll, int rr) {
			if(r < ll || l > rr) return 0;
			if(ll <= l && r <= rr) return sum;
			push();
			return left.query(ll, rr) + right.query(ll, rr);
		}
		void flip(int ll, int rr) {
			if(r < ll || l > rr) return;
			if(ll <= l && r <= rr) {
				delta = !delta;
				set();
				return;
			}
			push();
			left.flip(ll, rr);
			right.flip(ll, rr);
			sum = left.sum + right.sum;
		}
	}
	
	class SegmentTree {
		int n, N;
		int[] a;
		int[] l, r;
		boolean[] delta;
		int[] sum;
		SegmentTree(int[] aa) {
			n = aa.length;
			a = aa;
			N = 4 * n + 1;
			l = new int[N];
			r = new int[N];
			delta = new boolean[N];
			sum = new int[N];
			init(1, 0, n - 1);
		}
		void init(int node, int ll, int rr) {
			l[node] = ll; r[node] = rr;
			if(ll == rr) {
				sum[node] = a[ll];
				return;
			}
			int m = ll + rr >> 1;
			init(node * 2, ll, m);
			init(node * 2 + 1, m + 1, rr);
			sum[node] = sum[node * 2] + sum[node * 2 + 1];
		}
		int get(int node) {
			int ans = sum[node];
			if(delta[node]) ans = (r[node] - l[node] + 1) - ans;
			return ans;
		}
		void prop(int node) {
			if(!delta[node]) return;
			delta[node] = false;
			sum[node] = (r[node] - l[node] + 1) - sum[node];
			if(l[node] == r[node]) return;
			delta[node * 2] = !delta[node * 2];
			delta[node * 2 + 1] = !delta[node * 2 + 1];
		}
		int query(int node, int ll, int rr) {
			if(rr < l[node] || ll > r[node]) return 0;
			if(ll <= l[node] && r[node] <= rr) return get(node);
			prop(node);
			return query(node * 2, ll, rr) + query(node * 2 + 1, ll, rr);
		}
		int query(int ll, int rr) {
			return query(1, ll, rr);
		}
		void flip(int node, int ll, int rr) {
			if(rr < l[node] || ll > r[node]) return;
			if(ll <= l[node] && r[node] <= rr) {
				delta[node] = !delta[node];
				return;
			}
			prop(node);
			flip(node * 2, ll, rr);
			flip(node * 2 + 1, ll, rr);
			sum[node] = get(node * 2) + get(node * 2 + 1);
		}
		void flip(int ll, int rr) {
			flip(1, ll, rr);
		}
	}
	
	int n;
	ArrayList<Integer>[] vs;
	int[] first, last;
	int[] pre;
	int idx = 0;
	
	void dfs(int node) {
		pre[idx] = node;
		first[node] = idx++;
		for(int i : vs[node]) dfs(i);
		last[node] = idx - 1;
	}
	
	public void solve(JS in, PrintWriter out) {
		n = in.nextInt();
		vs = new ArrayList[n];
		for(int i = 0; i < n; ++i) vs[i] = new ArrayList<>();
		for(int i = 1; i < n; ++i) {
			int p = in.nextInt() - 1;
			vs[p].add(i);
		}
		first = new int[n];
		last = new int[n];
		pre = new int[n];
		dfs(0);
		int[] a = new int[n];
		for(int i = 0; i < n; ++i) a[first[i]] = in.nextInt();
//		Node st = new Node();
//		st.init(0, n - 1, a);
		SegmentTree st = new SegmentTree(a);
		int q = in.nextInt();
		while(q-->0) {
			String type = in.next();
			int node = in.nextInt() - 1;
			int from = first[node], to = last[node];
			if(type.equals("get")) {
				out.println(st.query(from, to));
			} else {
				st.flip(from, to);
			}
		}
	}
	
	public static void main(String[] args) {
		JS in = new JS();
		PrintWriter out = new PrintWriter(System.out);
		new E877().solve(in, out);
		out.close();
	}

	static class JS {
		public int BS = 1 << 16;
		public char NC = (char) 0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;

		public JS() {
			in = new BufferedInputStream(System.in, BS);
		}

		public JS(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}

		public char nextChar() {
			while (bId == size) {
				try {
					size = in.read(buf);
				} catch (Exception e) {
					return NC;
				}
				if (size == -1)
					return NC;
				bId = 0;
			}
			return (char) buf[bId++];
		}

		public int nextInt() {
			return (int) nextLong();
		}

		public long nextLong() {
			num = 1;
			boolean neg = false;
			if (c == NC)
				c = nextChar();
			for (; (c < '0' || c > '9'); c = nextChar()) {
				if (c == '-')
					neg = true;
			}
			long res = 0;
			for (; c >= '0' && c <= '9'; c = nextChar()) {
				res = (res << 3) + (res << 1) + c - '0';
				num *= 10;
			}
			return neg ? -res : res;
		}

		public double nextDouble() {
			double cur = nextLong();
			return c != '.' ? cur : cur + nextLong() / num;
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while (c <= 32)
				c = nextChar();
			while (c > 32) {
				res.append(c);
				c = nextChar();
			}
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while (c <= 32)
				c = nextChar();
			while (c != '\n') {
				res.append(c);
				c = nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if (c > 32)
				return true;
			while (true) {
				c = nextChar();
				if (c == NC)
					return false;
				else if (c > 32)
					return true;
			}
		}
	}
}