#include <bits/stdc++.h>
using namespace std;
int n, m, tot;
int anc[100100][20];
int dep[100100];
int l[100100], r[100100];
vector<int> v[100100], u[100100];
void dfs(int x) {
  l[x] = ++tot;
  u[dep[x]].push_back(tot);
  for (auto y : v[x]) {
    dep[y] = dep[x] + 1;
    dfs(y);
  }
  r[x] = tot;
}
int query(int x, int p) {
  int d = dep[x];
  if (p >= d) return 0;
  for (int i = 19; i >= 0; i--) {
    if (p >= (1 << i)) {
      p = p - (1 << i);
      x = anc[x][i];
    }
  }
  int up = upper_bound(u[d].begin(), u[d].end(), r[x]) - u[d].begin();
  int lo = lower_bound(u[d].begin(), u[d].end(), l[x]) - u[d].begin();
  return up - lo - 1;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    anc[i][0] = x;
    v[x].push_back(i);
  }
  dfs(0);
  for (int j = 1; j < 20; j++) {
    for (int i = 1; i <= n; i++) {
      int last = anc[i][j - 1];
      anc[i][j] = anc[last][j - 1];
    }
  }
  cin >> m;
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    int ans = query(x, y);
    cout << ans << " ";
  }
}
