#include <bits/stdc++.h>
using namespace std;
vector<int> g[100002];
int r[100002];
int s[100002], e[100002];
int T = 1;
int par[17][100002], depth[100002];
vector<int> d[100002];
void dfs(int u, int p, int d) {
  s[u] = T++;
  par[0][u] = p;
  depth[u] = d;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (v == p) continue;
    dfs(v, u, d + 1);
  }
  e[u] = T - 1;
}
int jump(int u, int k) {
  if (depth[u] < k) return -1;
  for (int i = 16; i >= 0; i--) {
    if ((k >> i) & 1) u = par[i][u];
  }
  return u;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &r[i]);
    if (r[i] != 0) {
      g[r[i]].emplace_back(i);
      g[i].emplace_back(r[i]);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (r[i] == 0) dfs(i, 0, 0);
  }
  for (int i = 1; i <= n; i++) {
    d[depth[i]].emplace_back(s[i]);
  }
  for (int i = 0; i <= n; i++) sort(d[i].begin(), d[i].end());
  for (int j = 1; j < 17; j++) {
    for (int i = 1; i <= n; i++) {
      if (par[j - 1][i] != 0) par[j][i] = par[j - 1][par[j - 1][i]];
    }
  }
  int m;
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    int v, p;
    scanf("%d%d", &v, &p);
    int u = jump(v, p);
    if (u == -1)
      printf("0 ");
    else {
      int D = depth[u] + p;
      int l = lower_bound(d[D].begin(), d[D].end(), s[u]) - d[D].begin();
      int r = upper_bound(d[D].begin(), d[D].end(), e[u]) - d[D].begin() - 1;
      printf("%d ", r - l + 1 - 1);
    }
  }
}
