#include <bits/stdc++.h>
using namespace std;
int d[100100], cnt = 0, lv[100100], last[100100];
vector<int> b[100100];
vector<int> a[100100];
int par[100100][19];
void dfs(int x) {
  int i;
  d[x] = ++cnt;
  b[lv[x]].push_back(d[x]);
  for (i = 0; i < a[x].size(); i++) {
    lv[a[x][i]] = lv[x] + 1;
    par[a[x][i]][0] = x;
    dfs(a[x][i]);
  }
  last[x] = cnt;
}
int cal(int x, int y) {
  vector<int>::iterator itl = lower_bound(b[x].begin(), b[x].end(), d[y]);
  vector<int>::iterator itr = upper_bound(b[x].begin(), b[x].end(), last[y]);
  if (itl == b[x].end()) return 0;
  itr--;
  if (*itl > *itr) return 0;
  return itr - itl + 1;
}
int main() {
  int n, i, x, j;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &x);
    a[x].push_back(i);
  }
  lv[0] = 1;
  dfs(0);
  for (i = 1; i <= 17; i++)
    for (j = 0; j <= n; j++) {
      par[j][i] = par[par[j][i - 1]][i - 1];
    }
  int p, v, q;
  scanf("%d", &p);
  while (p--) {
    scanf("%d %d", &v, &q);
    q--;
    int tmp = lv[v];
    for (i = 17; i >= 0; i--) {
      if (q >= (1 << i)) {
        v = par[v][i];
        q -= (1 << i);
      }
    }
    if (par[v][0] == 0) {
      printf("0 ");
      continue;
    } else
      printf("%d ", cal(tmp, par[v][0]) - 1);
  }
}
