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.io.BufferedReader;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.time.Instant;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class TaskE {
    public static void main(String[] args) {
        InputStream inputStream;
        String str = null;
        if(str == null){
            inputStream = System.in;
        }else{
            inputStream = new ByteArrayInputStream(str.getBytes());
        }
        
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solver solver = new Solver();
        solver.solve(1, in, out);
        out.close();
    }
    

    static class Solver {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int numPeople = in.nextInt();
            Person[] people = new Person[numPeople+1];
            int[] idMap= new int[numPeople+1];
            people[0] = null;
            boolean print = false;
            long time = Instant.now().toEpochMilli();
            
            LinkedList<Person> roots = new LinkedList<>();
            
            for(int i=1;i<=numPeople;i++){
                people[i] = new Person(i);
                people[i].max = 1;
            }
            
            for(int i=1;i<=numPeople;i++){ 
               people[i].setParent(people[in.nextInt()]);
                if(people[i].parent == null){
                    roots.add(people[i]);
                }
                
            }
            print = false && (numPeople == 100000) && 
                    (people[1].parent == null) && 
                    (people[2].parent == people[1]) && 
                    (people[3].parent == people[1]) && 
                    (people[5].parent == people[3]) && 
                    (people[4].parent == people[2]);
            if(print){
                long time2 = Instant.now().toEpochMilli();
                System.out.println(time2-time);
                time = time2;
            }
            int counter = 0;
            LinkedList<Person> toVisit = new LinkedList<>();
            ArrayList<ArrayList<Integer>> heights = new ArrayList<>();
            
            for(Person p : roots){
                toVisit.add(p);
                p.height = 0;
                HashSet<Person> visited = new HashSet<>();
                while(!toVisit.isEmpty()){
                    Person current = toVisit.getFirst();
                    if(visited.contains(current)){
                        toVisit.removeFirst();
                        if(current.parent != null){
                            current.parent.max += current.max;
                        }
                        continue;
                    }
                    if(current.parent!=null){
                        current.height = current.parent.height+1;
                    }
                    visited.add(current);
                    if(heights.size() <= current.height){
                        heights.add(new ArrayList<>());
                    }
                    idMap[counter] = current.ID;
                    current.ID = counter++;
                    
                    heights.get(current.height).add(current.ID);
                    
                    toVisit.addAll(0,current.children);
                    
                }
            }
            
            //Arrays.stream(idMap).forEach(s -> System.out.print(s+" "));System.out.println();
            if(print){
                long time2 = Instant.now().toEpochMilli();
                System.out.println(time2-time);
                time = time2;
            }
            int questions = in.nextInt();
            StringBuilder sb = new StringBuilder();
            for(int question=0;question<questions;question++){
                int index = in.nextInt();
                Person person = people[index];
                int level = in.nextInt();
                //System.out.println("level: " + level + " vs " + person.height);
                if(level > person.height){
                    sb.append("0 ");
                    continue;
                }
                if(print && question%10000 == 0){
                    long time2 = Instant.now().toEpochMilli();
                    System.out.println(question+": " + (time2-time));
                    time = time2;
                }
                
                //int i;
                //for(i=0;i<level && person != null;i++){
                //    person = person.parent;
                //}
                index = Collections.binarySearch(heights.get(person.height-level), person.ID);
                //System.out.println("index: " + index);
                if(index < 0){
                    index = (index+1)*-1-1;
                }else{
                    index++;
                }
                //System.out.print(person.ID+" ");
                person = people[idMap[heights.get(person.height-level).get(index)]];
                //System.out.println(person.ID);
                level = person.height+level;
                
                int l = person.ID;
                int r = person.ID+person.max+1;
                
                
                int left = Collections.binarySearch(heights.get(level), l);
                int right = Collections.binarySearch(heights.get(level), r);

                if(left < 0){
                    left = (left+1)*-1;
                }
                if(right < 0){
                    right = (right+1)*-1;
                }
               sb.append(Math.max(0,right-left-1));
               sb.append(" ");
            }
            
            System.out.println(sb);
        }
    }
    
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            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());
        }
        
        public long nextLong() {
            return Long.parseLong(next());
        }
    }
}


class Person{
    int ID;
    int height;
    int max=0;
    Person parent;
    LinkedList<Person> children = new LinkedList<>();
    public Person(int ID){
        this.ID = ID;
    }
    
    public void setParent(Person p){
        parent = p;
        if(parent != null){
            parent.children.add(this);
        }
        
    }
}