#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100010];
vector<pair<int, int>> q[100010];
int cnt[100010], sz[100010], dep[100010], ans[100010], par[100010][26];
bool big[100010];
void pre(int n) {
  for (int j = 1; j <= 20; ++j) {
    for (int i = 1; i <= n; ++i) {
      if (par[i][j - 1] != -1) par[i][j] = par[par[i][j - 1]][j - 1];
    }
  }
}
void dfs(int u, int p) {
  sz[u] = 1;
  dep[u] = dep[p] + 1;
  for (auto v : adj[u]) {
    if (v == p) continue;
    if (u) par[v][0] = u;
    dfs(v, u);
    sz[u] += sz[v];
  }
}
void add(int u, int p, int x) {
  cnt[dep[u]] += x;
  for (auto v : adj[u]) {
    if (v != p && !big[v]) {
      add(v, u, x);
    }
  }
}
int klevpar(int u, int k) {
  for (int i = 20; i >= 0; --i) {
    if (k & (1 << i)) {
      u = par[u][i];
      if (u == -1) break;
    }
  }
  return u;
}
void dsu(int u, int p, bool keep) {
  int bigchild = -1, mx = -1;
  for (auto v : adj[u]) {
    if (v != p && sz[v] > mx) {
      mx = sz[v];
      bigchild = v;
    }
  }
  for (auto v : adj[u]) {
    if (v != p && v != bigchild) {
      dsu(v, u, 0);
    }
  }
  if (bigchild != -1) {
    dsu(bigchild, u, 1);
    big[bigchild] = 1;
  }
  add(u, p, 1);
  for (auto x : q[u]) {
    ans[x.second] = cnt[dep[u] + x.first] - 1;
  }
  if (bigchild != -1) {
    big[bigchild] = 0;
  }
  if (keep == 0) {
    add(u, p, -1);
  }
}
int main() {
  int n, m;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int r;
    scanf("%d", &r);
    adj[r].push_back(i);
  }
  memset(par, -1, sizeof par);
  dfs(0, 0);
  pre(n);
  scanf("%d", &m);
  for (int i = 0; i < m; ++i) {
    int v, k;
    scanf("%d %d", &v, &k);
    v = klevpar(v, k);
    if (v != -1)
      q[v].emplace_back(k, i);
    else
      ans[i] = 0;
  }
  dsu(0, 0, 1);
  for (int i = 0; i < m; ++i) {
    printf("%d ", ans[i]);
  }
  printf("\n");
}
