#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const int MAXL = 23;
struct query {
  int v, height, id;
  query(int _v, int _h, int _id) {
    v = _v;
    height = _h;
    id = _id;
  }
};
vector<query> q[MAXN];
vector<int> grafo[MAXN];
int sub[MAXN], altura[MAXN], big[MAXN], maxalt[MAXN];
int tin[MAXN], revtin[MAXN], tout[MAXN];
int T;
int dp[MAXN][MAXL];
int ans[MAXN];
void dfssub(int x, int p) {
  revtin[++T] = x;
  tin[x] = T;
  maxalt[x] = altura[x], sub[x] = 1;
  int bigl = -1, auxbig = 0;
  for (int k = 1; k < MAXL; k++) {
    dp[x][k] = dp[dp[x][k - 1]][k - 1];
  }
  for (int i = 0; i < grafo[x].size(); i++) {
    int viz = grafo[x][i];
    if (viz == p) continue;
    dp[viz][0] = x;
    altura[viz] = altura[x] + 1;
    dfssub(viz, x);
    maxalt[x] = max(maxalt[x], maxalt[viz]);
    sub[x] += sub[viz];
    if (sub[viz] > auxbig) {
      auxbig = sub[viz];
      bigl = viz;
    }
  }
  big[x] = bigl;
  tout[x] = T;
}
int freq[MAXN];
void dfs(int x, int p, int keep) {
  int bigchild = big[x];
  for (int i = 0; i < grafo[x].size(); i++) {
    int viz = grafo[x][i];
    if (viz == p || viz == bigchild) continue;
    dfs(viz, x, 0);
  }
  if (bigchild != -1) dfs(bigchild, x, 1);
  for (int i = 0; i < grafo[x].size(); i++) {
    int viz = grafo[x][i];
    if (viz == p || viz == bigchild) continue;
    for (int j = tin[viz]; j <= tout[viz]; j++) {
      freq[altura[revtin[j]]]++;
    }
  }
  freq[altura[x]]++;
  for (int i = 0; i < q[x].size(); i++) {
    ans[q[x][i].id] = freq[q[x][i].height + altura[x]] - 1;
  }
  if (!keep) {
    for (int i = tin[x]; i <= tout[x]; i++) {
      freq[altura[revtin[i]]]--;
    }
  }
}
int pseudolca(int v, int dist) {
  for (int k = 0; k < MAXL; k++) {
    if (dist & (1 << k)) v = dp[v][k];
  }
  return v;
}
int n, m;
int pai[MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &pai[i]);
    if (pai[i] != 0) {
      grafo[i].push_back(pai[i]);
      grafo[pai[i]].push_back(i);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (pai[i] == 0) {
      altura[i] = 0;
      dfssub(i, 0);
    }
  }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    int v, h;
    scanf("%d %d", &v, &h);
    if (altura[v] < h) continue;
    v = pseudolca(v, h);
    q[v].push_back(query(v, h, i));
  }
  for (int i = 1; i <= n; i++) {
    if (pai[i] == 0) {
      dfs(i, 0, 0);
      for (int j = 0; j <= maxalt[i]; j++) freq[j] = 0;
    }
  }
  for (int i = 0; i < m; i++) {
    if (i) printf(" ");
    printf("%d", ans[i]);
  }
  printf("\n");
}

### Prompt

Develop a solution in cpp to the problem described below:

Polycarpus 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 vi, pi. Help him to calculate the number of pi-th cousins that person vi has, for each pair vi, pi.

Input

The first input line contains a single integer n (1 ≤ n ≤ 105) — the number of people in the tree. The next line contains n space-separated integers r1, r2, ..., rn, where ri (1 ≤ ri ≤ 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 ≤ 105) — the number of family relationship queries Polycarus has. Next m lines contain pairs of space-separated integers. The i-th line contains numbers vi, pi (1 ≤ vi, pi ≤ 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 

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const int MAXL = 23;
struct query {
  int v, height, id;
  query(int _v, int _h, int _id) {
    v = _v;
    height = _h;
    id = _id;
  }
};
vector<query> q[MAXN];
vector<int> grafo[MAXN];
int sub[MAXN], altura[MAXN], big[MAXN], maxalt[MAXN];
int tin[MAXN], revtin[MAXN], tout[MAXN];
int T;
int dp[MAXN][MAXL];
int ans[MAXN];
void dfssub(int x, int p) {
  revtin[++T] = x;
  tin[x] = T;
  maxalt[x] = altura[x], sub[x] = 1;
  int bigl = -1, auxbig = 0;
  for (int k = 1; k < MAXL; k++) {
    dp[x][k] = dp[dp[x][k - 1]][k - 1];
  }
  for (int i = 0; i < grafo[x].size(); i++) {
    int viz = grafo[x][i];
    if (viz == p) continue;
    dp[viz][0] = x;
    altura[viz] = altura[x] + 1;
    dfssub(viz, x);
    maxalt[x] = max(maxalt[x], maxalt[viz]);
    sub[x] += sub[viz];
    if (sub[viz] > auxbig) {
      auxbig = sub[viz];
      bigl = viz;
    }
  }
  big[x] = bigl;
  tout[x] = T;
}
int freq[MAXN];
void dfs(int x, int p, int keep) {
  int bigchild = big[x];
  for (int i = 0; i < grafo[x].size(); i++) {
    int viz = grafo[x][i];
    if (viz == p || viz == bigchild) continue;
    dfs(viz, x, 0);
  }
  if (bigchild != -1) dfs(bigchild, x, 1);
  for (int i = 0; i < grafo[x].size(); i++) {
    int viz = grafo[x][i];
    if (viz == p || viz == bigchild) continue;
    for (int j = tin[viz]; j <= tout[viz]; j++) {
      freq[altura[revtin[j]]]++;
    }
  }
  freq[altura[x]]++;
  for (int i = 0; i < q[x].size(); i++) {
    ans[q[x][i].id] = freq[q[x][i].height + altura[x]] - 1;
  }
  if (!keep) {
    for (int i = tin[x]; i <= tout[x]; i++) {
      freq[altura[revtin[i]]]--;
    }
  }
}
int pseudolca(int v, int dist) {
  for (int k = 0; k < MAXL; k++) {
    if (dist & (1 << k)) v = dp[v][k];
  }
  return v;
}
int n, m;
int pai[MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &pai[i]);
    if (pai[i] != 0) {
      grafo[i].push_back(pai[i]);
      grafo[pai[i]].push_back(i);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (pai[i] == 0) {
      altura[i] = 0;
      dfssub(i, 0);
    }
  }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    int v, h;
    scanf("%d %d", &v, &h);
    if (altura[v] < h) continue;
    v = pseudolca(v, h);
    q[v].push_back(query(v, h, i));
  }
  for (int i = 1; i <= n; i++) {
    if (pai[i] == 0) {
      dfs(i, 0, 0);
      for (int j = 0; j <= maxalt[i]; j++) freq[j] = 0;
    }
  }
  for (int i = 0; i < m; i++) {
    if (i) printf(" ");
    printf("%d", ans[i]);
  }
  printf("\n");
}

```