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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;

public class BloodCuz {
    ArrayList<Integer>[] T;
    int[] p;
    int[] s;
    int[] t;
    int[] lev;
    int[] arr;
    int[][] parent;
    int top;
    int[] qres;

    class event implements Comparable<event> {
        int i, lev, qi, t;

        public event(int i, int lev, int qi, int t) {
            this.i = i;
            this.lev = lev;
            this.qi = qi;
            this.t = t;
        }

        @Override
        public int compareTo(event arg0) {
            if (i != arg0.i)
                return i - arg0.i;
            return t - arg0.t;
        }
    }

//  public void dfs(int i) {
//      lev[i] = lev[p[i]] + 1;
//      s[i] = top++;
//      for (int j : T[i])
//          dfs(j);
//      t[i] = top - 1;
//  }

    public void dfs(int root) {
        Stack<Integer> S = new Stack<Integer>();
        S.push(root);
        while (!S.isEmpty()) {
            int c = S.pop();
            if (lev[c] == -1) {
                S.push(c);
                lev[c] = lev[p[c]] + 1;
                s[c] = top++;
                for (int j : T[c])
                    S.push(j);
            } else
                t[c] = top - 1;
        }
    }

    public void run() {
        InputReader in = new InputReader(System.in);
        int n = in.nextInt();
        T = new ArrayList[n + 1];
        p = new int[n + 1];
        for (int i = 0; i <= n; i++)
            T[i] = new ArrayList<Integer>();
        parent = new int[20][n + 1];
        for (int i = 1; i <= n; i++) {
            int pi = in.nextInt();
            T[pi].add(i);
            parent[0][i] = p[i] = pi;
        }
        top = 0;
        s = new int[n + 1];
        t = new int[n + 1];
        lev = new int[n + 1];
        arr = new int[n + 1];
        Arrays.fill(lev, -1);
        for (int i = 1; i <= n; i++)
            if (p[i] == 0)
                dfs(i);
        for (int i = 0; 1 << i < n; i++)
            for (int j = 1; j <= n; j++)
                parent[i + 1][j] = parent[i][parent[i][j]];
        int q = in.nextInt();
        ArrayList<event> lst = new ArrayList<event>();
        for (int i = 1; i <= n; i++)
            lst.add(new event(s[i], lev[i], 0, 1));
        qres = new int[q];
        for (int i = 0; i < q; i++) {
            int node = in.nextInt();
            int p = in.nextInt();
            int tl = lev[node];
            for (int j = 0; j < 20; j++)
                if (((1 << j) & p) != 0) {
                    node = parent[j][node];
                }
            if (node == 0) {
                qres[i] = 1;
                continue;
            }
            lst.add(new event(s[node], tl, i, 0));
            lst.add(new event(t[node], tl, i, 2));
        }
        Collections.sort(lst);
        int[] cnt = new int[n + 1];
        for (int i = 0; i < lst.size(); i++) {
            event ev = lst.get(i);
            if (ev.t == 1)
                cnt[ev.lev]++;
            else if (ev.t == 0)
                qres[ev.qi] = -cnt[ev.lev];
            else if (ev.t == 2)
                qres[ev.qi] += cnt[ev.lev];
        }
        for (int i = 0; i < q; i++)
            System.out.print((qres[i] - 1) + " ");
        System.out.println();
    }

    public static void main(String[] args) throws Exception {
        (new BloodCuz()).run();
    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}
