#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 3, MAX_POWER = 10 + 9;
int ancesstor[MAXN][MAX_POWER], height[MAXN], startingTime[MAXN],
    finishingTime[MAXN];
vector<int> adj[MAXN], treeFloor[MAXN];
queue<int> BFSQue;
bool isPassed[MAXN];
void dfs(int root, int parent = -1) {
  isPassed[root] = true;
  ancesstor[root][0] = parent;
  if (ancesstor[root][0] != -1) {
    for (int i = 1; (1 << i) <= height[root]; ++i) {
      ancesstor[root][i] = ancesstor[ancesstor[root][i - 1]][i - 1];
    }
  }
  finishingTime[root] = startingTime[root] + 1;
  for (int i = 0; i < (int)adj[root].size(); ++i) {
    int neighbour = adj[root][i];
    if (!isPassed[neighbour]) {
      startingTime[neighbour] = finishingTime[root];
      height[neighbour] = height[root] + 1;
      treeFloor[height[neighbour]].push_back(startingTime[neighbour]);
      dfs(neighbour, root);
      finishingTime[root] = finishingTime[neighbour] + 1;
    }
  }
  return;
}
int parentFinder(int vertex, int counter) {
  for (int i = 0; (1 << i) <= counter; ++i) {
    if (((counter >> i) & 1) == 1) {
      vertex = ancesstor[vertex][i];
    }
  }
  return vertex;
}
int main() {
  memset(ancesstor, -1, sizeof ancesstor);
  int amountOfVertex;
  cin >> amountOfVertex;
  for (int i = 0; i < amountOfVertex; ++i) {
    int temp;
    cin >> temp;
    temp--;
    if (temp < 0) continue;
    adj[i].push_back(temp);
    adj[temp].push_back(i);
  }
  int startTemp = 0;
  for (int i = 0; i < amountOfVertex; ++i) {
    if (!isPassed[i]) {
      startingTime[i] = startTemp;
      treeFloor[0].push_back(i);
      dfs(i);
      startTemp = finishingTime[i] + 1;
    }
  }
  cerr << "parentFinder(3, 1)"
       << " = " << (parentFinder(3, 1)) << "   ";
  int amountOfQueries;
  cin >> amountOfQueries;
  for (int i = 0; i < amountOfQueries; ++i) {
    int tempV, tempHeight;
    cin >> tempV >> tempHeight;
    tempV--;
    if (height[tempV] < tempHeight) {
      cout << 0 << " " << flush;
      continue;
    }
    int par = parentFinder(tempV, tempHeight);
    int begining =
        upper_bound(treeFloor[height[tempV]].begin(),
                    treeFloor[height[tempV]].end(), startingTime[par]) -
        treeFloor[height[tempV]].begin();
    int ending =
        upper_bound(treeFloor[height[tempV]].begin(),
                    treeFloor[height[tempV]].end(), finishingTime[par]) -
        treeFloor[height[tempV]].begin() - 1;
    cout << (ending - begining) << " " << flush;
  }
  return 0;
}
