#include <bits/stdc++.h>
using namespace std;
int a[17][110000];
vector<int> ch[110000];
vector<int> d[110000];
pair<int, int> posi[110000];
vector<pair<int, int> > q;
int solve(int x, int p) {
  int i, now;
  now = x;
  for (i = 16; i >= 0; i--)
    if (((1 << i) & p) != 0) {
      if (now != -1) now = a[i][now];
    }
  return now;
}
int get(int x, int p) {
  int left, right, mid, tmp, x1, x2;
  pair<int, int> xx;
  xx = posi[x];
  left = -1;
  right = d[xx.first + p].size();
  while (right - left > 1) {
    mid = (left + right) / 2;
    tmp = solve(d[xx.first + p][mid], p);
    if (posi[tmp].second < xx.second)
      left = mid;
    else
      right = mid;
  }
  x1 = right;
  left = -1;
  right = d[xx.first + p].size();
  while (right - left > 1) {
    mid = (left + right) / 2;
    tmp = solve(d[xx.first + p][mid], p);
    if (posi[tmp].second <= xx.second)
      left = mid;
    else
      right = mid;
  }
  x2 = left;
  return x2 - x1 + 1;
}
int main() {
  int i, j, n, x, y, all, now, m;
  scanf("%d", &n);
  for (i = 0; i < n; i++) ch[i].clear();
  for (i = 0; i < n; i++) {
    scanf("%d", &x);
    x--;
    a[0][i] = x;
    if (x != -1) ch[x].push_back(i);
  }
  for (i = 1; i < 17; i++) {
    for (j = 0; j < n; j++) {
      if (a[i - 1][j] == -1)
        a[i][j] = -1;
      else
        a[i][j] = a[i - 1][a[i - 1][j]];
    }
  }
  for (i = 0; i < n; i++) d[i].clear();
  for (i = 0; i < n; i++)
    if (a[0][i] == -1) {
      d[0].push_back(i);
      posi[i] = make_pair(0, d[0].size() - 1);
      q.clear();
      q.push_back(make_pair(0, i));
      while (q.size() > 0) {
        pair<int, int> p = q[q.size() - 1];
        q.pop_back();
        for (j = 0; j < ch[p.second].size(); j++) {
          q.push_back(make_pair(p.first + 1, ch[p.second][j]));
        }
        if (ch[p.second].size() > 0) {
          for (j = ch[p.second].size() - 1; j >= 0; j--) {
            d[p.first + 1].push_back(ch[p.second][j]);
            posi[ch[p.second][j]] =
                make_pair(p.first + 1, d[p.first + 1].size() - 1);
          }
        }
      }
    }
  scanf("%d", &m);
  for (i = 0; i < m; i++) {
    if (i != 0) printf(" ");
    scanf("%d%d", &x, &y);
    x--;
    now = solve(x, y);
    if (now == -1) {
      printf("0");
    } else {
      all = get(now, y);
      all--;
      printf("%d", all);
    }
  }
  printf("\n");
}
