#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 10, MAX = 2e5 + 1e4, MOD = 1e9 + 7, MAXL = 25;
void OUT(long double o, int x) {
  cout << fixed << setprecision(x) << o;
  return;
}
long long dp[MAX][MAXL], h[MAX], t = 0, st[MAX], fi[MAX];
bool vis[MAX];
vector<pair<long long, long long> > vh[MAX];
vector<int> adj[MAX];
void dfs(int v, int p) {
  vis[v] = 1;
  dp[v][0] = p;
  h[v] = h[p] + 1;
  st[v] = t;
  t++;
  for (int i = 1; i <= 20; i++) dp[v][i] = dp[dp[v][i - 1]][i - 1];
  for (int u : adj[v])
    if (u != p) dfs(u, v);
  fi[v] = t;
  vh[h[v]].push_back({st[v], t});
  return;
}
int getp(int v, int k) {
  for (int i = 0; i <= 20; i++)
    if (k & (1 << i)) v = dp[v][i];
  return v;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    long long x;
    cin >> x;
    if (x != 0) {
      adj[i].push_back(x);
      adj[x].push_back(i);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) dfs(i, i);
  }
  for (int i = 1; i <= n; i++) sort(vh[i].begin(), vh[i].end());
  cin >> m;
  while (m--) {
    long long x, y;
    cin >> x >> y;
    if (h[x] <= y)
      cout << "0 ";
    else {
      long long v = getp(x, y), ans = 0;
      pair<long long, long long> p1 = {fi[v] + 1, 0}, p2 = {st[v], 0};
      ans =
          lower_bound(vh[h[x]].begin(), vh[h[x]].end(), p1) - vh[h[x]].begin();
      ans -=
          lower_bound(vh[h[x]].begin(), vh[h[x]].end(), p2) - vh[h[x]].begin();
      cout << ans - 1 << " ";
    }
  }
  return 0;
}
