Problem: 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

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class Main {
    public static void main(String arg[])
    {
        new Main();
    }
    LinkedList<Integer> adj[];
    ArrayList<Integer> natd[];
    int io[],oo[],dp[];
    int t;
    void dfs(int u,int d)
    {
        io[u]=t;
        natd[d].add(t);
        dp[u]=d;
        t++;
        for (Integer v: adj[u])
            dfs(v,d+1);
        oo[u]=t;
    }
    public Main()
    {
        Scanner cin=new Scanner(new BufferedInputStream(System.in));
        int n=cin.nextInt();
        adj=new LinkedList[n+2];
        for (int i=1;i<=n;i++)
            adj[i]=new LinkedList<Integer>();
        natd=new ArrayList[n+2];
        for (int i=0;i<n;i++)
            natd[i]=new ArrayList<Integer>();
        io=new int[n+2];
        oo=new int[n+2];
        dp=new int[n+2];
        int f[][]=new int[20][n+2];
        for (int i=0;i<20;i++)
            Arrays.fill(f[i],0);
        LinkedList<Integer> root=new LinkedList<Integer>();
        for (int i=1;i<=n;i++)
        {
            int r=cin.nextInt();
            if (r!=0)
            {
                adj[r].add(i);
                f[0][i]=r;
            }
            else root.add(i);
        }
        for (int i=1;i<=n;i++)
        {
            for (int j=1;j<20;j++)
                f[j][i]=f[j-1][f[j-1][i]];
        }
        t=0;
        for (int r: root) dfs(r,0);
        for (int i=0;i<n;i++)
            Collections.sort(natd[i],new Comparator<Integer>(){public int compare(Integer a,Integer b){if (a==b) return 0;else return a<b?-1:1;}});
        int m=cin.nextInt();
        for (int i=1;i<=m;i++)
        {
            int v=cin.nextInt(),p=cin.nextInt();
            for (int j=0;j<20;j++)
                if ((p&(1<<j))!=0)
                    v=f[j][v];
            int answer=0;
            if (v!=0)
            {
                int L,R,d=dp[v]+p;
                L=-1;
                R=natd[d].size()-1;
                while (L+1!=R)
                {
                    int mid=(L+R)/2;
                    if (natd[d].get(mid)<=io[v]) L=mid;
                    else R=mid;
                }
                int b=R;
                L=0;
                R=natd[d].size();
                while (L+1!=R)
                {
                    int mid=(L+R)/2;
                    if (natd[d].get(mid)>oo[v]) R=mid;
                    else L=mid;
                }
                int e=L;
                answer=e-b;
            }
            if (i==m) System.out.println(answer);
            else System.out.print(answer+" ");
        }
        cin.close();
    }
}