#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int col[N];
vector<int> G[N];
int sz[N], son[N], dep[N], fa[N][20];
void dfs(int x, int ff) {
  for (int i = 1; i <= 19; i++) fa[x][i] = fa[fa[x][i - 1]][i - 1];
  sz[x] = 1;
  for (int v : G[x]) {
    if (v == ff) continue;
    dep[v] = dep[x] + 1;
    fa[v][0] = x;
    dfs(v, x);
    sz[x] += sz[v];
    if (sz[son[x]] < sz[v]) son[x] = v;
  }
}
int Son;
int cnt[N];
int ans[N];
vector<pair<int, int>> Q[N];
void add(int x, int fa, int val) {
  cnt[dep[x]] += val;
  for (int v : G[x]) {
    if (v == fa || Son == v) continue;
    add(v, x, val);
  }
}
void DFS(int x, int fa, int key) {
  for (int v : G[x]) {
    if (v == fa || v == son[x]) continue;
    DFS(v, x, 0);
  }
  if (son[x]) DFS(son[x], x, 1), Son = son[x];
  add(x, fa, 1);
  Son = 0;
  for (auto p : Q[x]) {
    int d = p.first, id = p.second;
    ans[id] = cnt[d] - 1;
  }
  if (key == 0) add(x, fa, -1);
}
int rt[N];
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  int rtcnt = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    if (x == 0)
      rt[++rtcnt] = i;
    else {
      G[x].push_back(i);
      G[i].push_back(x);
    }
  }
  for (int i = 1; i <= rtcnt; i++) dfs(rt[i], 0);
  int m;
  cin >> m;
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    int d = dep[x];
    for (int i = 19; i >= 0; i--)
      if (y >> i & 1) x = fa[x][i];
    Q[x].push_back({d, i});
  }
  for (int i = 1; i <= rtcnt; i++) DFS(rt[i], 0, 0);
  for (int i = 1; i <= m; i++) cout << ans[i] << ' ';
  return 0;
}
