#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m;
int anc[N][20];
vector<int> g[N];
int t, ans;
int in_time[N];
int out_time[N];
int deep[N];
vector<int> v[N];
void dfs(int i, int p) {
  in_time[i] = t;
  v[deep[i]].push_back(t);
  t++;
  for (auto x : g[i]) {
    if (x == p) continue;
    deep[x] = deep[i] + 1;
    dfs(x, i);
  }
  out_time[i] = t++;
}
void lca_in_it() {
  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];
    }
  }
}
int query(int x, int p) {
  if (deep[x] <= p) return 0;
  int level = deep[x];
  for (int jump = 19; jump >= 0; jump--) {
    if (p >= (1 << jump)) {
      p = p - (1 << jump);
      x = anc[x][jump];
    }
  }
  int lo = upper_bound(v[level].begin(), v[level].end(), in_time[x]) -
           v[level].begin();
  int up = lower_bound(v[level].begin(), v[level].end(), out_time[x] - 1) -
           v[level].begin();
  return (up - lo - 1);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    anc[i][0] = x;
    g[x].push_back(i);
  }
  dfs(0, -1);
  lca_in_it();
  cin >> m;
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    ans = query(x, y);
    cout << ans << " ";
  }
}
