#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
vector<int> g[N];
struct query {
  int dep, id;
};
vector<query> q[N];
int son[N], sz[N], ans[N], deep[N], father[N], n, fn[N][30];
void dfs(int u, int fa) {
  sz[u] = 1;
  deep[u] = deep[fa] + 1;
  fn[u][0] = fa;
  for (int i = 1; i < 30; i++) {
    fn[u][i] = fn[fn[u][i - 1]][i - 1];
  }
  for (int to : g[u]) {
    if (to == fa) continue;
    dfs(to, u);
    sz[u] += sz[to];
    if (sz[son[u]] < sz[to]) {
      son[u] = to;
    }
  }
}
int cnt[N];
void work(int v, int u, int fa, int zson) {
  cnt[deep[u]] += v;
  for (int to : g[u]) {
    if (to == fa || to == zson) continue;
    work(v, to, u, zson);
  }
}
void gao(int u) {
  for (int i = 0; i < q[u].size(); i++) {
    int id = q[u][i].id;
    int dep = deep[q[u][i].dep];
    ans[id] = cnt[dep] - 1;
  }
}
void dfs1(int u, int fa, int ok) {
  for (int to : g[u]) {
    if (to == fa || to == son[u]) {
      continue;
    }
    dfs1(to, u, 1);
  }
  if (son[u]) {
    dfs1(son[u], u, 0);
  }
  work(1, u, fa, son[u]);
  gao(u);
  if (ok) {
    work(-1, u, fa, -1);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int u;
    scanf("%d", &u);
    father[i] = u;
    if (u) {
      g[i].push_back(u);
      g[u].push_back(i);
    }
  }
  int m;
  scanf("%d", &m);
  for (int i = 1; i <= n; i++) {
    if (father[i] == 0) {
      dfs(i, 0);
    }
  }
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    int now = u;
    int cn = 0;
    while (v) {
      if (v & 1) {
        now = fn[now][cn];
      }
      cn++;
      v = v / 2;
    }
    q[now].push_back({u, i});
  }
  for (int i = 1; i <= n; i++) {
    if (father[i] == 0) {
      dfs1(i, 0, 1);
    }
  }
  for (int i = 1; i <= m; i++) {
    printf("%d ", ans[i]);
  }
  puts("");
}
