#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<int> roots;
vector<vector<pair<int, int> > > raw;
struct border {
  int l, r;
};
int h[100305];
vector<border> br;
vector<int> topsort;
int cnt = 0;
void dfs1(int v, int _h) {
  h[v] = _h;
  topsort[cnt] = v;
  br[v].l = cnt++;
  for (auto u : g[v]) dfs1(u, _h + 1);
  topsort[cnt] = v;
  br[v].r = cnt++;
}
struct query {
  int v, p;
  int qn;
};
vector<query> qs;
int qt = 0;
vector<int> st;
void dfs2(int v) {
  for (auto pr : raw[v]) {
    int k = pr.first;
    int qn = pr.second;
    query q;
    q.v = v;
    q.qn = qn;
    if (k <= st.size()) {
      q.p = st[st.size() - k];
    } else {
      q.v = q.p = -1;
    }
    qs[qt++] = q;
  }
  st.push_back(v);
  for (auto u : g[v]) {
    dfs2(u);
  }
  st.pop_back();
}
int hcnt[201234] = {0};
int K;
bool qcmp(query a, query b) {
  if (br[a.p].l % K != br[b.p].l % K) return br[a.p].l < br[b.p].l;
  return br[a.p].r < br[b.p].r;
}
int wl, wr;
void movel(int l) {
  if (wl == l) return;
  while (wl > l) {
    hcnt[h[topsort[--wl]]]++;
  }
  while (wl < l) {
    hcnt[h[topsort[wl++]]]--;
  }
}
void mover(int r) {
  if (wr == r) return;
  while (wr < r) {
    hcnt[h[topsort[++wr]]]++;
  }
  while (wr > r) {
    hcnt[h[topsort[wr--]]]--;
  }
}
int n;
void read() {
  cin >> n;
  g.resize(n);
  for (int i = 0; i < n; i++) {
    int p;
    cin >> p;
    if (p > 0) {
      g[p - 1].push_back(i);
    } else {
      roots.push_back(i);
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  read();
  br.resize(n);
  topsort.resize(n + n + 1337);
  for (auto r : roots) dfs1(r, 0);
  raw.resize(n);
  int q;
  cin >> q;
  qs.resize(q);
  for (int i = 0; i < q; i++) {
    int v, k;
    cin >> v >> k;
    raw[v - 1].push_back(make_pair(k, i));
  }
  for (auto r : roots) dfs2(r);
  K = (int)sqrt(n + n);
  sort(qs.begin(), qs.end(), qcmp);
  vector<int> ans(q);
  wl = 0, wr = -1;
  for (auto qr : qs) {
    if (qr.v == -1) {
      ans[qr.qn] = 0;
      continue;
    }
    mover(br[qr.p].r);
    movel(br[qr.p].l);
    ans[qr.qn] = hcnt[h[qr.v]] / 2 - 1;
  }
  for (auto el : ans) cout << el << " ";
  cout << endl;
  return 0;
}

### Prompt

Create a solution in Cpp for 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;
vector<vector<int> > g;
vector<int> roots;
vector<vector<pair<int, int> > > raw;
struct border {
  int l, r;
};
int h[100305];
vector<border> br;
vector<int> topsort;
int cnt = 0;
void dfs1(int v, int _h) {
  h[v] = _h;
  topsort[cnt] = v;
  br[v].l = cnt++;
  for (auto u : g[v]) dfs1(u, _h + 1);
  topsort[cnt] = v;
  br[v].r = cnt++;
}
struct query {
  int v, p;
  int qn;
};
vector<query> qs;
int qt = 0;
vector<int> st;
void dfs2(int v) {
  for (auto pr : raw[v]) {
    int k = pr.first;
    int qn = pr.second;
    query q;
    q.v = v;
    q.qn = qn;
    if (k <= st.size()) {
      q.p = st[st.size() - k];
    } else {
      q.v = q.p = -1;
    }
    qs[qt++] = q;
  }
  st.push_back(v);
  for (auto u : g[v]) {
    dfs2(u);
  }
  st.pop_back();
}
int hcnt[201234] = {0};
int K;
bool qcmp(query a, query b) {
  if (br[a.p].l % K != br[b.p].l % K) return br[a.p].l < br[b.p].l;
  return br[a.p].r < br[b.p].r;
}
int wl, wr;
void movel(int l) {
  if (wl == l) return;
  while (wl > l) {
    hcnt[h[topsort[--wl]]]++;
  }
  while (wl < l) {
    hcnt[h[topsort[wl++]]]--;
  }
}
void mover(int r) {
  if (wr == r) return;
  while (wr < r) {
    hcnt[h[topsort[++wr]]]++;
  }
  while (wr > r) {
    hcnt[h[topsort[wr--]]]--;
  }
}
int n;
void read() {
  cin >> n;
  g.resize(n);
  for (int i = 0; i < n; i++) {
    int p;
    cin >> p;
    if (p > 0) {
      g[p - 1].push_back(i);
    } else {
      roots.push_back(i);
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  read();
  br.resize(n);
  topsort.resize(n + n + 1337);
  for (auto r : roots) dfs1(r, 0);
  raw.resize(n);
  int q;
  cin >> q;
  qs.resize(q);
  for (int i = 0; i < q; i++) {
    int v, k;
    cin >> v >> k;
    raw[v - 1].push_back(make_pair(k, i));
  }
  for (auto r : roots) dfs2(r);
  K = (int)sqrt(n + n);
  sort(qs.begin(), qs.end(), qcmp);
  vector<int> ans(q);
  wl = 0, wr = -1;
  for (auto qr : qs) {
    if (qr.v == -1) {
      ans[qr.qn] = 0;
      continue;
    }
    mover(br[qr.p].r);
    movel(br[qr.p].l);
    ans[qr.qn] = hcnt[h[qr.v]] / 2 - 1;
  }
  for (auto el : ans) cout << el << " ";
  cout << endl;
  return 0;
}

```