#include <bits/stdc++.h>
char rd;
int pn;
template <typename Type>
inline void read(Type &v) {
  pn = 1;
  while ((rd = getchar()) < '0' || rd > '9')
    if (rd == '-') pn = -1;
  v = rd - '0';
  while ((rd = getchar()) >= '0' && rd <= '9') v = v * 10 + rd - '0';
  v *= pn;
}
struct Edge {
  int v, next;
  Edge(int _v = 0, int nxt = 0) {
    v = _v;
    next = nxt;
  }
};
using namespace std;
const int maxn = 1e5 + 2;
int n, p[maxn][18], pre[maxn], post[maxn], dfs_clock, m, dep[maxn];
Edge edg[maxn];
int cnt, g[maxn];
vector<int> node[maxn];
void dfs(int u) {
  node[dep[u]].push_back(u);
  pre[u] = ++dfs_clock;
  Edge *e;
  for (int i = g[u]; i; i = e->next) {
    e = &edg[i];
    if (e->v != p[u][0]) {
      dep[e->v] = dep[u] + 1;
      dfs(e->v);
    }
  }
  post[u] = ++dfs_clock;
}
int kanc(int u, int k) {
  for (int j = 17; j >= 0; --j) {
    if ((1 << j) <= k) {
      u = p[u][j];
      k -= (1 << j);
    }
  }
  return u;
}
int sum(int u, int k) {
  int l, r, mid, v, dp = dep[u] + k, ans;
  l = 0;
  r = node[dp].size() - 1;
  while (l < r) {
    mid = (l + r) / 2;
    v = node[dp][mid];
    if (pre[v] < pre[u]) {
      l = mid + 1;
    } else
      r = mid;
  }
  ans = r;
  l = 0;
  r = node[dp].size() - 1;
  while (l < r) {
    mid = (l + r) / 2 + 1;
    v = node[dp][mid];
    if (post[v] <= post[u])
      l = mid;
    else
      r = mid - 1;
  }
  return r - ans;
}
int main() {
  read(n);
  int x, y, z;
  for (int i = 1; i <= n; ++i) {
    read(x);
    p[i][0] = x;
    edg[++cnt] = Edge(i, g[x]);
    g[x] = cnt;
    ;
  }
  dfs(0);
  for (int j = 1; j < 18; ++j) {
    for (int i = 1; i <= n; ++i) {
      p[i][j] = p[p[i][j - 1]][j - 1];
    }
  }
  read(m);
  for (int i = 1; i <= m; ++i) {
    read(x);
    read(y);
    z = kanc(x, y);
    if (z)
      printf("%d ", sum(z, y));
    else
      printf("0 ");
  }
}
