#include <bits/stdc++.h>
using namespace std;
inline int Read() {
  int x(0), f(1);
  char c(getchar());
  while (c < '0' || '9' < c) {
    if (c == '-') {
      f = -1;
    }
    c = getchar();
  }
  while ('0' <= c && c <= '9') {
    x = (x << 1) + (x << 3) + c - '0';
    c = getchar();
  }
  return f * x;
}
void Write(int x) {
  if (x < 0) {
    printf("-");
    x = -x;
  }
  if (9 < x) {
    Write(x / 10);
  }
  putchar(x % 10 + '0');
}
inline void Writeln(int x) {
  Write(x);
  puts("");
}
const int MAXN = 1e5 + 5;
const int MAXM = MAXN << 1;
int n, m;
char val[MAXN];
int sum[MAXN];
struct Query {
  int deep, id;
  Query(int deep, int id) : deep(deep), id(id) {}
};
vector<Query> query[MAXN];
struct Edge {
  int to, next;
} edge[MAXM];
int edge_head[MAXN];
int edge_cnt = 0;
void AddEdge(int form, int to) {
  edge[++edge_cnt].to = to;
  edge[edge_cnt].next = edge_head[form];
  edge_head[form] = edge_cnt;
}
int son[MAXN];
int size[MAXN];
int deep[MAXN];
int father[MAXN][19];
bool Check(int a) { return a == (a & -a); }
void DFS_1(int now = 1) {
  for (int i = 1; i <= 18; ++i) {
    father[now][i] = father[father[now][i - 1]][i - 1];
  }
  deep[now] = deep[father[now][0]] + 1;
  size[now] = 1;
  for (int edge_i = edge_head[now]; edge_i; edge_i = edge[edge_i].next) {
    DFS_1(edge[edge_i].to);
    size[now] += size[edge[edge_i].to];
    if (size[son[now]] < size[edge[edge_i].to]) {
      son[now] = edge[edge_i].to;
    }
  }
}
int Find(int now, int k) {
  for (int i = 19; i >= 0; --i) {
    if ((1 << i) <= k) {
      now = father[now][i];
      k -= (1 << i);
    }
  }
  return now;
}
int im_son;
int answer[MAXN];
void Add(int now) {
  sum[deep[now]]++;
  for (int edge_i = edge_head[now]; edge_i; edge_i = edge[edge_i].next) {
    if (edge[edge_i].to ^ im_son) {
      Add(edge[edge_i].to);
    }
  }
}
void Delete(int now, bool flag = 1) {
  sum[deep[now]]--;
  for (int edge_i = edge_head[now]; edge_i; edge_i = edge[edge_i].next) {
    if (edge[edge_i].to ^ im_son) {
      Delete(edge[edge_i].to, 0);
    }
  }
}
void DFS_2(int now, int opt = 0) {
  for (int edge_i = edge_head[now]; edge_i; edge_i = edge[edge_i].next) {
    if (edge[edge_i].to ^ son[now]) {
      DFS_2(edge[edge_i].to, 1);
    }
  }
  if (son[now]) {
    DFS_2(son[now], 0);
  }
  im_son = son[now];
  Add(now);
  if (query[now].size()) {
    for (int i = 0; i <= query[now].size() - 1; ++i) {
      answer[query[now][i].id] = sum[query[now][i].deep] - 1;
    }
  }
  im_son = 0;
  if (opt) {
    Delete(now);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &father[i][0]);
    AddEdge(father[i][0], i);
  }
  for (int i = 1; i <= n; ++i) {
    if (!father[i][0]) {
      DFS_1(i);
    }
  }
  scanf("%d", &m);
  int u, k;
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d", &u, &k);
    u = Find(u, k);
    if (u) {
      query[u].push_back(Query{deep[u] + k, i});
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (!father[i][0]) {
      DFS_2(i, 1);
    }
  }
  for (int i = 1; i <= m; ++i) {
    printf("%d ", answer[i]);
  }
  return 0;
}
