Polycarpus got hold of a family tree. The found tree describes the family relations of n people, numbered from 1 to n. Every person in this tree has at most one direct ancestor. Also, each person in the tree has a name, the names are not necessarily unique.

We call the man with a number a a 1-ancestor of the man with a number b, if the man with a number a is a direct ancestor of the man with a number b.

We call the man with a number a a k-ancestor (k > 1) of the man with a number b, if the man with a number b has a 1-ancestor, and the man with a number a is a (k - 1)-ancestor of the 1-ancestor of the man with a number b.

In the tree the family ties do not form cycles. In other words there isn't a person who is his own direct or indirect ancestor (that is, who is an x-ancestor of himself, for some x, x > 0).

We call a man with a number a the k-son of the man with a number b, if the man with a number b is a k-ancestor of the man with a number a.

Polycarpus is very much interested in how many sons and which sons each person has. He took a piece of paper and wrote m pairs of numbers vi, ki. Help him to learn for each pair vi, ki the number of distinct names among all names of the ki-sons of the man with number vi.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 105) — the number of people in the tree. Next n lines contain the description of people in the tree. The i-th line contains space-separated string si and integer ri (0 ≤ ri ≤ n), where si is the name of the man with a number i, and ri is either the number of the direct ancestor of the man with a number i or 0, if the man with a number i has no direct ancestor. 

The next line contains a single integer m (1 ≤ m ≤ 105) — the number of Polycarpus's records. Next m lines contain space-separated pairs of integers. The i-th line contains integers vi, ki (1 ≤ vi, ki ≤ n).

It is guaranteed that the family relationships do not form cycles. The names of all people are non-empty strings, consisting of no more than 20 lowercase English letters.

Output

Print m whitespace-separated integers — the answers to Polycarpus's records. Print the answers to the records in the order, in which the records occur in the input.

Examples

Input

6
pasha 0
gerald 1
gerald 1
valera 2
igor 3
olesya 1
5
1 1
1 2
1 3
3 1
6 1


Output

2
2
0
1
0


Input

6
valera 0
valera 1
valera 1
gerald 0
valera 4
kolya 4
7
1 1
1 2
2 1
2 2
4 1
5 1
6 1


Output

1
0
0
0
2
0
0
#include <bits/stdc++.h>
using namespace std;
const int MAXM = 100001;
const int MAXV = 200001;
const int MAXE = 500001;
const int MAXL = 51;
struct query {
  int id, l, r;
};
typedef char str[MAXL];
typedef int verArr[MAXV];
typedef int edgArr[MAXE];
int n, m, p, v, k, w, H, N, tk, sid;
verArr lk, lt, rt, dep, dfn, snm;
edgArr nx, tl;
vector<int> ht[MAXV], nm[MAXV];
vector<query> q[MAXV];
int ans[MAXM];
str name;
map<string, int> id;
map<int, int> s;
inline int ID(const string& s) {
  if (id.count(s) > 0)
    return id[s];
  else
    return id[s] = ++sid;
}
inline void addEdge(int u, int v) {
  if (!w) w++;
  w++, nx[w] = lk[u], lk[u] = w, tl[w] = v;
  w++, nx[w] = lk[v], lk[v] = w, tl[w] = u;
}
inline void DFS(int u, int p) {
  dfn[u] = ++tk;
  ht[dep[u]].push_back(dfn[u]);
  nm[dep[u]].push_back(snm[u]);
  lt[u] = tk;
  for (int e = lk[u]; e > 0; e = nx[e]) {
    int v = tl[e];
    if (v != p) {
      dep[v] = dep[u] + 1;
      DFS(v, u);
    }
  }
  rt[u] = tk;
}
inline bool cmp(const query& a, const query& b) {
  int a_pos = a.l / N, b_pos = b.l / N;
  return a_pos < b_pos || (a_pos == b_pos && a.r < b.r);
}
inline void doInsert(int& res, int dep, int l, int r) {
  for (int i = l; i <= r; ++i) {
    int j = nm[dep][i];
    if (!s[j]) res++;
    s[j]++;
  }
}
inline void doErase(int& res, int dep, int l, int r) {
  for (int i = l; i <= r; ++i) {
    int j = nm[dep][i];
    s[j]--;
    if (!s[j]) res--;
  }
}
inline void whileProcess() {
  N = (int)sqrt((double)n);
  for (int i = 1; i <= n; ++i) H = max(H, dep[i]);
  for (int i = 1; i <= H; ++i) {
    sort(q[i].begin(), q[i].end(), cmp);
    s.clear();
    int res = 0, L = 1, R = 0;
    for (int j = 0; j < (int)q[i].size(); ++j) {
      if (q[i][j].l < L) doInsert(res, i, q[i][j].l, L - 1);
      if (q[i][j].l > L) doErase(res, i, L, q[i][j].l - 1);
      if (q[i][j].r < R) doErase(res, i, q[i][j].r + 1, R);
      if (q[i][j].r > R) doInsert(res, i, R + 1, q[i][j].r);
      L = q[i][j].l, R = q[i][j].r;
      ans[q[i][j].id] = res;
    }
  }
}
int main() {
  scanf("%d\n", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%s %d\n", name, &p);
    snm[i] = ID(name);
    addEdge(i, p);
  }
  DFS(0, -1);
  scanf("%d\n", &m);
  for (int i = 1; i <= m; ++i) {
    scanf("%d %d\n", &v, &k);
    int DEP = dep[v] + k;
    int L =
        lower_bound(ht[DEP].begin(), ht[DEP].end(), lt[v]) - ht[DEP].begin();
    int R =
        upper_bound(ht[DEP].begin(), ht[DEP].end(), rt[v]) - ht[DEP].begin();
    q[DEP].push_back((query){i, L, R - 1});
  }
  whileProcess();
  for (int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
  fclose(stdin);
  fclose(stdout);
  return 0;
}
