#include <bits/stdc++.h>
using namespace std;
const int maxn = 100123, lgn = 19;
int f[lgn][maxn], sz[maxn], big[maxn], ans[maxn], cnt[maxn], depth[maxn];
vector<vector<int> > G;
vector<vector<pair<int, int> > > Q;
vector<int> roots;
void dfs_sz(int u = 0, int p = -1, int h = 0) {
  sz[u] = 1;
  depth[u] = h;
  f[0][u] = p;
  for (int i = 1; i < lgn; ++i) f[i][u] = f[i - 1][f[i - 1][u]];
  for (auto v : G[u]) {
    if (v != p) dfs_sz(v, u, h + 1), sz[u] += sz[v];
  }
}
int kth_ancestor(int v, int k) {
  for (int i = lgn - 1; i >= 0; --i) {
    if (k >= (1 << i)) v = f[i][v], k -= 1 << i;
  }
  return v;
}
void add(int u, int p, int h, int x) {
  cnt[h] += x;
  for (auto v : G[u]) {
    if (v != p && !big[v]) add(v, u, h + 1, x);
  }
}
void dfs(int u = 0, int p = -1, int h = 0, bool keep = false) {
  int mx = -1, bigChild = -1;
  for (auto v : G[u]) {
    if (v != p && sz[v] > mx) mx = sz[v], bigChild = v;
  }
  for (auto v : G[u]) {
    if (v != p && v != bigChild) dfs(v, u, h + 1, 0);
  }
  if (bigChild != -1) dfs(bigChild, u, h + 1, 1), big[bigChild] = 1;
  add(u, p, h, 1);
  for (auto q : Q[u]) {
    int v, i;
    tie(v, i) = q;
    ans[i] = cnt[h + v] - 1;
  }
  if (bigChild != -1) big[bigChild] = 0;
  if (!keep) add(u, p, h, -1);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  G.resize(n);
  Q.resize(n);
  for (int i = 0; i < n; ++i) {
    int p;
    cin >> p;
    if (p)
      G[p - 1].push_back(i);
    else
      roots.push_back(i);
  }
  int q;
  cin >> q;
  for (auto root : roots) dfs_sz(root, root);
  for (int i = 0; i < q; ++i) {
    int v, p;
    cin >> v >> p;
    --v;
    if (depth[v] < p) continue;
    v = kth_ancestor(v, p);
    Q[v].emplace_back(p, i);
  }
  for (auto root : roots) dfs(root);
  for (int i = 0; i < q; ++i) cout << ans[i] << " ";
}
