#include <bits/stdc++.h>
using namespace std;
const int block = 1000;
struct node {
  int idx, l, r, val;
  node() {}
  node(int ii, int ll, int rr, int v) {
    idx = ii;
    l = ll;
    r = rr;
    val = v;
  }
  inline pair<int, int> toPair() const {
    return make_pair(l / block, ((l / block) & 1) ? -r : +r);
  }
};
inline bool operator<(const node &a, const node &b) {
  return a.toPair() < b.toPair();
}
const int N = 3e5 + 100;
int t = 0;
vector<node> qry;
vector<int> ord(N), adj[N], dep(N), in(N, -1), out(N), ans(N);
int up[N][20];
void dfs(int src, int par) {
  in[src] = ++t;
  ord[in[src]] = dep[src];
  for (int i : adj[src]) {
    if (i == par) continue;
    dep[i] = 1 + dep[src];
    up[i][0] = src;
    for (int j = 1; j < 20; j++) up[i][j] = up[up[i][j - 1]][j - 1];
    dfs(i, src);
  }
  out[src] = t;
}
void lift(int &u, int &p) {
  for (int i = 19; i >= 0; i--)
    if ((1 << i) <= p) {
      p -= (1 << i);
      u = up[u][i];
    }
}
int hm[N];
void add(int x) { hm[ord[x]]++; }
void remove(int x) { hm[ord[x]]--; }
void mos() {
  int cur_l = 0, cur_r = -1;
  sort(qry.begin(), qry.end());
  for (auto &q : qry) {
    while (cur_l > q.l) {
      cur_l--;
      add(cur_l);
    }
    while (cur_r > q.r) {
      remove(cur_r);
      cur_r--;
    }
    while (cur_l < q.l) {
      remove(cur_l);
      cur_l++;
    }
    while (cur_r < q.r) {
      cur_r++;
      add(cur_r);
    }
    ans[q.idx] = hm[q.val] - 1;
  }
  return;
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    if (x == 0) continue;
    adj[x].push_back(i);
    adj[i].push_back(x);
  }
  for (int i = 1; i <= n; i++) {
    if (in[i] == -1) dfs(i, i);
  }
  int q;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int u, p;
    cin >> u >> p;
    int d = dep[u];
    lift(u, p);
    if (u == 0) {
      ans[i] = 0;
      continue;
    }
    qry.emplace_back(i, in[u], out[u], d);
  }
  mos();
  for (int i = 1; i <= q; i++) {
    cout << ans[i] << '\n';
  }
  return 0;
}
