#include <bits/stdc++.h>
using namespace std;
int n, l[100001], newn[100001], idx = -1, start, cnt[100001], t[100001],
                                p[100001][18];
vector<vector<int> > v(100001);
vector<int> roots;
bool visited[100001];
vector<int> L[100001];
int dfs(int node, int level, int parent) {
  if (visited[node]) return 0;
  visited[node] = 1;
  idx++;
  newn[node] = idx;
  l[newn[node]] = level;
  L[l[newn[node]]].push_back(newn[node]);
  t[newn[node]] = parent;
  int c = 1;
  for (int i = 0; i < v[node].size(); i++)
    c += dfs(v[node][i], level + 1, newn[node]);
  return cnt[newn[node]] = c;
}
void build() {
  for (int i = 0; i < n; i++) p[i][0] = t[i];
  for (int j = 1; 1 << j <= n; j++)
    for (int i = 0; i < n; i++) p[i][j] = p[p[i][j - 1]][j - 1];
}
int get(int a, int P) {
  int want = l[a] - P;
  for (int j = 17; j >= 0; j--)
    if (l[a] - (1 << j) >= want) a = p[a][j];
  return a;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    a--;
    if (a == -1) {
      roots.push_back(i);
      continue;
    }
    v[a].push_back(i);
    v[i].push_back(a);
  }
  for (int i = 0; i < roots.size(); i++)
    if (!visited[roots[i]]) start = idx + 1, dfs(roots[i], 0, roots[i]);
  build();
  for (int i = 0; i < 100001; i++) sort(L[i].begin(), L[i].end());
  int q;
  cin >> q;
  while (q--) {
    int v, P;
    cin >> v >> P;
    v--;
    v = newn[v];
    if (l[v] - P < 0) {
      cout << 0 << '\n';
      continue;
    }
    int u = get(v, P);
    int desiredlevel = l[u] + P;
    cout << upper_bound(L[desiredlevel].begin(), L[desiredlevel].end(),
                        u + cnt[u] - 1) -
                lower_bound(L[desiredlevel].begin(), L[desiredlevel].end(), u) -
                1
         << '\n';
  }
  return 0;
}
