In one country, there is a government consisting of N deputies in a certain hierarchy. At the top is the Prime Minister, who has no immediate superiors and is numbered 1, while each other deputy has exactly one immediate superior.

Unfortunately for them, the next Q days will be very difficult — the president of the country has decided to test the government for efficiency. On the i-th day, he can perform one of two actions:

Initially, deputies have no tasks. The tasks are impossible to complete, but it’s better not to mention this to the president, as he might dissolve the government. You are required to assist the deputies who need to prepare reports. If on the i-th day a request for reports on tasks comes in, inform how many reports this deputy will have to write in total.

The first line contains an integer N — the number of deputies in the government (2 ≤ N ≤ 10⁵).

The second line contains N−1 integers p_i — the numbers of the immediate superiors of the deputies numbered from 2 to N (1 ≤ p_i ≤ i − 1).

The third line contains an integer Q — the number of days on which the president will make requests (1 ≤ Q ≤ 10⁵).

The following Q lines describe these requests in the following format:

• + v_i k_i x_i — on the i-th day, the president gives the deputy with number v_i x_i impossible tasks with access level k_i (1 ≤ v_i ≤ N, 0 ≤ k_i ≤ N, 1 ≤ x_i ≤ 10⁹).
• ? v_i — on the i-th day, the president requests a report on each of the tasks that the deputy with number v_i is currently working on (1 ≤ v_i ≤ N).

For each day when the president requests reports, output the number of reports.