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:
/**
 * DA-IICT
 * Author : Savaliya Sagar
 */
import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.fill;
import static java.lang.Math.*;
import static java.util.Arrays.sort;
import static java.util.Collections.sort;

public class E877
{
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	ArrayList<Integer> a[];
	int s[], e[];
	int time = 0;
	int n;
	int t[];
	int arr[];
	void solve()
	{
		n = ni();
		a = new ArrayList[n + 1];
		s = new int[n + 1];
		e = new int[n + 1];
		arr = new int[n+1];
		for (int i = 0; i <= n; i++)
		{
			a[i] = new ArrayList<>();
		}
		for (int i = 2; i <= n; i++)
		{
			a[ni()].add(i);
		}
		dfs(1);
		t = na(n);
		for(int i=1;i<=n;i++){
			arr[s[i]] = i;
		}
		init(n);
		int q = ni();
		
		while(q-->0){
			String l = ns();
			int v = ni();
			if(l.equals("pow")){
				updateRange(1, 1, n, s[v], e[v]);
			}else{
				long ans = queryRange(1, 1, n, s[v], e[v]);
				out.println(ans);
			}
		}
	}
	
	void dfs(int u) {
		time++;
		s[u] = time;
		for (int k : a[u]) {
			dfs(k);
		}
		e[u] = time;
	}
	
	long tree[];
	long lazy[];

	public void init(int n) {
		tree = new long[4 * n];
		lazy = new long[4 * n];
		build(1, 1, n);
	}
	void build(int node, int start, int end) {
		if (start == end) {
			tree[node] = t[arr[start]];
		} else {
			int mid = (start + end) / 2;
			build(2 * node, start, mid);
			build(2 * node + 1, mid + 1, end);
			tree[node] = tree[2 * node] + tree[2 * node + 1];
		}
	}


	void updateRange(int node, int start, int end, int l, int r) {
		if (lazy[node] != 0) {
			tree[node] = end - start + 1 - tree[node];
			if (start != end) {
				lazy[node * 2] ^= 1;
				lazy[node * 2 + 1] ^= 1;
			}
			lazy[node] = 0;
		}
		if (start > end || start > r || end < l)
			return;
		if (start >= l && end <= r) {
			tree[node] = end - start + 1 - tree[node];
			if (start != end) {
				lazy[node * 2] ^= 1;
				lazy[node * 2 + 1] ^= 1;
			}
			return;
		}
		int mid = (start + end) / 2;
		updateRange(node * 2, start, mid, l, r);
		updateRange(node * 2 + 1, mid + 1, end, l, r);
		tree[node] = tree[node * 2]+tree[node * 2 + 1];
	}

	long queryRange(int node, int start, int end, int l, int r) {
		if (start > end || start > r || end < l)
			return 0;
		if (lazy[node] != 0) {
			tree[node] = end - start + 1 - tree[node];
			if (start != end) {
				lazy[node * 2] ^= 1;
				lazy[node * 2 + 1] ^= 1;
			}
			lazy[node] = 0;
		}
		if (start >= l && end <= r)
			return tree[node];
		int mid = (start + end) / 2;
		long p1 = queryRange(node * 2, start, mid, l, r);
		long p2 = queryRange(node * 2 + 1, mid + 1, end, l, r);
		return p1+p2;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if (!INPUT.isEmpty())
			tr(System.currentTimeMillis() - s + "ms");
	}
	private int[] na(int n)
	{
		int[] a = new int[n + 1];
		for (int i = 1; i < n + 1; i++)
			a[i] = ni();
		return a;
	}
	public static void main(String[] args) throws Exception
	{
		new Thread(null, new Runnable()
		{
			public void run()
			{
				try
				{
					new E877().run();
				} catch (Exception e)
				{
					e.printStackTrace();
				}
			}
		}, "1", 1 << 26).start();
	}
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if (lenbuf == -1)
			throw new InputMismatchException();
		if (ptrbuf >= lenbuf)
		{
			ptrbuf = 0;
			try
			{
				lenbuf = is.read(inbuf);
			} catch (IOException e)
			{
				throw new InputMismatchException();
			}
			if (lenbuf <= 0)
				return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c)
	{
		return !(c >= 33 && c <= 126);
	}
	
	private int skip()
	{
		int b;
		while ((b = readByte()) != -1 && isSpaceChar(b))
			;
		return b;
	}
	
	private double nd()
	{
		return Double.parseDouble(ns());
	}
	
	private char nc()
	{
		return (char) skip();
	}
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while (!(isSpaceChar(b)))
		{ // when nextLine, (isSpaceChar(b) && b !=
				// ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while (p < n && !(isSpaceChar(b)))
		{
			buf[p++] = (char) b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for (int i = 0; i < n; i++)
			map[i] = ns(m);
		return map;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
			;
		if (b == '-')
		{
			minus = true;
			b = readByte();
		}
		
		while (true)
		{
			if (b >= '0' && b <= '9')
			{
				num = num * 10 + (b - '0');
			} else
			{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
			;
		if (b == '-')
		{
			minus = true;
			b = readByte();
		}
		
		while (true)
		{
			if (b >= '0' && b <= '9')
			{
				num = num * 10 + (b - '0');
			} else
			{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private void tr(Object... o)
	{
		System.out.println(Arrays.deepToString(o));
	}
}