Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Danil and a Part-time Job

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDanil 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:

- pow v describes a task to switch lights in the subtree of vertex
*v*. - 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 *p*_{2}, *p*_{3}, ..., *p*_{n} (1 ≤ *p*_{i} < *i*), where *p*_{i} is the ancestor of vertex *i*.

The third line contains *n* space-separated integers *t*_{1}, *t*_{2}, ..., *t*_{n} (0 ≤ *t*_{i} ≤ 1), where *t*_{i} 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

The tree after the task pow 1.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2019 17:07:34 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|