Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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. Blood Cousins

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarpus got hold of a family relationship tree. The tree describes family relationships of *n* people, numbered 1 through *n*. Each person in the tree has no more than one parent.

Let's call person *a* a 1-ancestor of person *b*, if *a* is the parent of *b*.

Let's call person *a* a *k*-ancestor (*k* > 1) of person *b*, if person *b* has a 1-ancestor, and *a* is a (*k* - 1)-ancestor of *b*'s 1-ancestor.

Family relationships don't form cycles in the found tree. In other words, there is no person who is his own ancestor, directly or indirectly (that is, who is an *x*-ancestor for himself, for some *x*, *x* > 0).

Let's call two people *x* and *y* (*x* ≠ *y*) *p*-th cousins (*p* > 0), if there is person *z*, who is a *p*-ancestor of *x* and a *p*-ancestor of *y*.

Polycarpus wonders how many counsins and what kinds of them everybody has. He took a piece of paper and wrote *m* pairs of integers *v*_{i}, *p*_{i}. Help him to calculate the number of *p*_{i}-th cousins that person *v*_{i} has, for each pair *v*_{i}, *p*_{i}.

Input

The first input line contains a single integer *n* (1 ≤ *n* ≤ 10^{5}) — the number of people in the tree. The next line contains *n* space-separated integers *r*_{1}, *r*_{2}, ..., *r*_{n}, where *r*_{i} (1 ≤ *r*_{i} ≤ *n*) is the number of person *i*'s parent or 0, if person *i* has no parent. It is guaranteed that family relationships don't form cycles.

The third line contains a single number *m* (1 ≤ *m* ≤ 10^{5}) — the number of family relationship queries Polycarus has. Next *m* lines contain pairs of space-separated integers. The *i*-th line contains numbers *v*_{i}, *p*_{i} (1 ≤ *v*_{i}, *p*_{i} ≤ *n*).

Output

Print *m* space-separated integers — the answers to Polycarpus' queries. Print the answers to the queries in the order, in which the queries occur in the input.

Examples

Input

6

0 1 1 0 4 4

7

1 1

1 2

2 1

2 2

4 1

5 1

6 1

Output

0 0 1 0 0 1 1

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/20/2019 15:30:35 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|