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 maxn = 1e5 + 10;
const int INF = 1e18;
int n, sub[maxn], q, h[maxn], ans[maxn];
string c[maxn];
vector<int> g[maxn], roots;
vector<pair<int, int> > qu[maxn], vec[maxn];
set<string> cnt[2 * maxn];
map<pair<int, string>, int> cnt2;
void dfs(int v, int p) {
  sub[v] = 1;
  for (auto u : g[v]) {
    if (u != p) {
      h[u] = h[v] + 1;
      dfs(u, v);
      sub[v] += sub[u];
    }
  }
}
void gooni(int v, int p, bool keep) {
  int mx = -1, bigch = -1;
  for (auto u : g[v])
    if (u != p)
      if (sub[u] > mx) mx = sub[u], bigch = u;
  for (auto u : g[v])
    if (u != p && u != bigch) gooni(u, v, 0);
  if (bigch != -1) {
    gooni(bigch, v, 1);
    swap(vec[v], vec[bigch]);
  }
  for (auto u : g[v]) {
    if (u != p && u != bigch) {
      for (auto x : vec[u]) {
        vec[v].push_back(x);
        cnt[x.second].insert(c[x.first]);
        cnt2[make_pair(x.second, c[x.first])]++;
      }
    }
  }
  vec[v].push_back({v, h[v]});
  cnt[h[v]].insert(c[v]);
  cnt2[make_pair(h[v], c[v])]++;
  for (auto qq : qu[v]) {
    int k = qq.first, ind = qq.second;
    ans[ind] = cnt[h[v] + k].size();
  }
  if (keep == 0) {
    for (auto x : vec[v]) {
      cnt2[make_pair(x.second, c[x.first])]--;
      if (cnt2[make_pair(x.second, c[x.first])] == 0)
        cnt[x.second].erase(c[x.first]);
    }
  }
}
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int v;
    cin >> c[i] >> v;
    if (v == 0) {
      h[i] = 1;
      roots.push_back(i);
    } else {
      g[v].push_back(i);
      g[i].push_back(v);
    }
  }
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int v, k;
    cin >> v >> k;
    qu[v].push_back({k, i});
  }
  for (auto v : roots) dfs(v, 0);
  for (auto v : roots) gooni(v, 0, 0);
  for (int i = 1; i <= q; i++) cout << ans[i] << "\n";
  return 0;
}
