#include <bits/stdc++.h>
using namespace std;
map<pair<long long, long long>, long long> mp;
const int N = +1e+5 + 5;
const int LG = 20;
vector<long long> g[N];
long long parent[LG][N];
long long timer = 0;
long long tin[N], tout[N], level[N];
vector<long long> vv[N];
long long n, p;
long long cnt = 0;
long long arr[N];
void dfs(long long v, long long par, long long lvl) {
  arr[v] = cnt;
  tin[v] = ++timer;
  parent[0][v] = par;
  level[v] = lvl;
  vv[lvl].push_back(timer);
  for (auto &u : g[v]) {
    if (u == par) continue;
    dfs(u, v, lvl + 1);
  }
  tout[v] = timer;
}
bool is_ancestor(int u, int v) {
  return (tin[u] <= tin[v] and tout[u] >= tout[v]);
}
void precompute() {
  for (int i = 1; i < LG; i++) {
    for (int j = 1; j <= n; j++) {
      if (parent[i - 1][j]) {
        parent[i][j] = parent[i - 1][parent[i - 1][j]];
      }
    }
  }
}
long long kthancestor(long long v, long long p) {
  long long curr = v;
  for (long long i = 20; i >= 0; i--) {
    if (1 << i & p) curr = parent[i][curr];
  }
  return curr;
}
void solve() {
  long long x;
  cin >> n;
  vector<long long> v;
  for (long long i = 1; i <= n; i++) {
    cin >> x;
    if (x == 0) {
      v.push_back(i);
    } else {
      g[x].push_back(i);
      g[i].push_back(x);
    }
  }
  for (long long x : v) {
    dfs(x, 0, 0);
    cnt++;
  }
  precompute();
  long long m;
  cin >> m;
  for (long long i = 1; i <= m; i++) {
    long long v, p;
    cin >> v >> p;
    long long x = kthancestor(v, p);
    if (x == 0) {
      cout << 0 << " ";
    } else {
      long long y = level[v];
      long long ans = upper_bound(vv[y].begin(), vv[y].end(), tout[x]) -
                      lower_bound(vv[y].begin(), vv[y].end(), tin[x]);
      ans--;
      cout << ans << " ";
    }
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  t = 1;
  while (t--) solve();
  return 0;
}
