#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100000 + 10;
const int Maxm = 5000000 + 10;
const int inf = 0x3f3f3f3f;
int root[Maxn], head[Maxn];
int nxt[Maxn << 1], to[Maxn << 1];
int f[Maxn][23], c[Maxn];
int sum[Maxm], d[Maxn];
int ls[Maxm], rs[Maxm];
int n, m, edgecnt, idcnt, cnt;
inline int read() {
  int s = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
  return s * w;
}
inline void add(int x, int y) {
  ++edgecnt;
  nxt[edgecnt] = head[x];
  to[edgecnt] = y;
  head[x] = edgecnt;
}
inline void push_up(int x) { sum[x] = sum[ls[x]] + sum[rs[x]]; }
inline void modify(int &x, int l, int r, int pos, int v) {
  if (!x) x = ++idcnt;
  if (l == r) {
    sum[x] += v;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    modify(ls[x], l, mid, pos, v);
  else
    modify(rs[x], mid + 1, r, pos, v);
  push_up(x);
}
int merge(int x, int y) {
  if (!x || !y) return x | y;
  int cur = ++idcnt;
  sum[cur] = sum[x] + sum[y];
  ls[cur] = merge(ls[x], ls[y]);
  rs[cur] = merge(rs[x], rs[y]);
  return cur;
}
int query(int x, int l, int r, int pos) {
  if (!x) return 0;
  if (l == r) return sum[x];
  int mid = (l + r) >> 1;
  if (pos <= mid)
    return query(ls[x], l, mid, pos);
  else
    return query(rs[x], mid + 1, r, pos);
}
void dfs(int x, int fa) {
  f[x][0] = fa, d[x] = d[fa] + 1;
  for (int i = 1; i <= 17; ++i) f[x][i] = f[f[x][i - 1]][i - 1];
  for (int i = head[x]; i; i = nxt[i]) {
    int y = to[i];
    if (y == fa) continue;
    dfs(y, x);
    root[x] = merge(root[x], root[y]);
  }
  modify(root[x], 1, n, d[x], 1);
}
int find(int x, int k) {
  for (int i = 17; i >= 0; --i)
    if (k & (1 << i)) x = f[x][i];
  return x;
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) {
    int x = read();
    if (!x)
      c[++cnt] = i;
    else
      add(i, x), add(x, i);
  }
  for (int i = 1; i <= cnt; ++i) dfs(c[i], 0);
  m = read();
  while (m--) {
    int x = read(), k = read();
    int pos = find(x, k);
    if (!pos)
      printf("0 ");
    else
      printf("%d ", query(root[pos], 1, n, d[x]) - 1);
  }
  return 0;
}

### Prompt

Please formulate a Cpp solution to the following problem:

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 = 100000 + 10;
const int Maxm = 5000000 + 10;
const int inf = 0x3f3f3f3f;
int root[Maxn], head[Maxn];
int nxt[Maxn << 1], to[Maxn << 1];
int f[Maxn][23], c[Maxn];
int sum[Maxm], d[Maxn];
int ls[Maxm], rs[Maxm];
int n, m, edgecnt, idcnt, cnt;
inline int read() {
  int s = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
  return s * w;
}
inline void add(int x, int y) {
  ++edgecnt;
  nxt[edgecnt] = head[x];
  to[edgecnt] = y;
  head[x] = edgecnt;
}
inline void push_up(int x) { sum[x] = sum[ls[x]] + sum[rs[x]]; }
inline void modify(int &x, int l, int r, int pos, int v) {
  if (!x) x = ++idcnt;
  if (l == r) {
    sum[x] += v;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    modify(ls[x], l, mid, pos, v);
  else
    modify(rs[x], mid + 1, r, pos, v);
  push_up(x);
}
int merge(int x, int y) {
  if (!x || !y) return x | y;
  int cur = ++idcnt;
  sum[cur] = sum[x] + sum[y];
  ls[cur] = merge(ls[x], ls[y]);
  rs[cur] = merge(rs[x], rs[y]);
  return cur;
}
int query(int x, int l, int r, int pos) {
  if (!x) return 0;
  if (l == r) return sum[x];
  int mid = (l + r) >> 1;
  if (pos <= mid)
    return query(ls[x], l, mid, pos);
  else
    return query(rs[x], mid + 1, r, pos);
}
void dfs(int x, int fa) {
  f[x][0] = fa, d[x] = d[fa] + 1;
  for (int i = 1; i <= 17; ++i) f[x][i] = f[f[x][i - 1]][i - 1];
  for (int i = head[x]; i; i = nxt[i]) {
    int y = to[i];
    if (y == fa) continue;
    dfs(y, x);
    root[x] = merge(root[x], root[y]);
  }
  modify(root[x], 1, n, d[x], 1);
}
int find(int x, int k) {
  for (int i = 17; i >= 0; --i)
    if (k & (1 << i)) x = f[x][i];
  return x;
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) {
    int x = read();
    if (!x)
      c[++cnt] = i;
    else
      add(i, x), add(x, i);
  }
  for (int i = 1; i <= cnt; ++i) dfs(c[i], 0);
  m = read();
  while (m--) {
    int x = read(), k = read();
    int pos = find(x, k);
    if (!pos)
      printf("0 ");
    else
      printf("%d ", query(root[pos], 1, n, d[x]) - 1);
  }
  return 0;
}

```