#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
vector<int> rt;
vector<int> dep[100050];
vector<int> g[100050];
int in[100050], out[100050], dfn = 0, p[100050][20], deep[100050];
void dfs(int x, int fa) {
  in[x] = ++dfn;
  p[x][0] = fa;
  deep[x] = deep[fa] + 1;
  dep[deep[x]].push_back(dfn);
  for (int j = 1; j <= 18; j++) p[x][j] = p[p[x][j - 1]][j - 1];
  for (int i = 0; i < g[x].size(); i++) {
    int v = g[x][i];
    if (v == fa) continue;
    dfs(v, x);
  }
  out[x] = dfn;
}
inline int finds(int x, int k) {
  for (int i = 18; i >= 0; i--)
    if (k & (1 << i)) x = p[x][i];
  return x;
}
inline int solve(int dfn, int d) {
  int l = 0, r = dep[d].size() - 1, ans = -1;
  while (l <= r) {
    int mid = l + r >> 1;
    if (dep[d][mid] <= dfn)
      l = mid + 1, ans = mid;
    else
      r = mid - 1;
  }
  return ans;
}
int main() {
  int n = read();
  for (int i = 1; i <= n; i++) {
    int x = read();
    if (x != 0)
      g[x].push_back(i);
    else
      rt.push_back(i);
  }
  for (int i = 0; i < rt.size(); i++) dfs(rt[i], 0);
  int m = read();
  while (m--) {
    int x = read(), p = read();
    int anc = finds(x, p);
    if (anc == 0)
      printf("0 ");
    else
      printf("%d ", solve(out[anc], deep[x]) - solve(in[anc], deep[x]) - 1);
  }
}
