Given a sequence of integers a1, ..., an and q queries x1, ..., xq on it. For each query xi you have to count the number of pairs (l, r) such that 1 ≤ l ≤ r ≤ n and gcd(al, al + 1, ..., ar) = xi.

<image> is a greatest common divisor of v1, v2, ..., vn, that is equal to a largest positive integer that divides all vi.

Input

The first line of the input contains integer n, (1 ≤ n ≤ 105), denoting the length of the sequence. The next line contains n space separated integers a1, ..., an, (1 ≤ ai ≤ 109).

The third line of the input contains integer q, (1 ≤ q ≤ 3 × 105), denoting the number of queries. Then follows q lines, each contain an integer xi, (1 ≤ xi ≤ 109).

Output

For each query print the result in a separate line.

Examples

Input

3
2 6 3
5
1
2
3
4
6


Output

1
2
2
0
1


Input

7
10 20 3 15 1000 60 16
10
1
2
3
4
5
6
10
20
60
1000


Output

14
0
2
2
2
0
2
2
1
1
import java.io.*;
import java.util.*;


public class Bayan2015QDGCDqueries {

	public static void main(String args[] ) throws Exception {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    PrintWriter w = new PrintWriter(System.out);
	        
	    StringTokenizer st1 = new StringTokenizer(br.readLine());
	    int n = ip(st1.nextToken());
	          
	    StringTokenizer st2 = new StringTokenizer(br.readLine());
	    int a[] = new int[n];
	    for(int i=0;i<n;i++)
	    	a[i] = ip(st2.nextToken());
	    
	    Map<Integer,Integer> divisors = new TreeMap<Integer,Integer>();
	    Map<Integer,Integer> nextDivisors = new TreeMap<Integer,Integer>();
	    Map<Integer,Long> result = new TreeMap<Integer,Long>();
	    
	    for(int i=0;i<n;i++){
	    	Iterator<Integer> d1 = divisors.keySet().iterator();
	    	nextDivisors.clear();
	    	while(d1.hasNext()){
	    		int c = d1.next();
	    		int v = divisors.get(c);
	    		int nc = gcd(c,a[i]);
	    		if(nextDivisors.containsKey(nc))
	    			nextDivisors.put(nc, nextDivisors.get(nc)+v);
	    		else
	    			nextDivisors.put(nc, v);
	    		if(result.containsKey(nc))
	    			result.put(nc, result.get(nc)+v);
	    		else
	    			result.put(nc, (long)v);
	    	}
	    	if(nextDivisors.containsKey(a[i]))
	    		nextDivisors.put(a[i], 1 + nextDivisors.get(a[i]));
	    	else
	    		nextDivisors.put(a[i], 1);
	    	if(result.containsKey(a[i]))
	    		result.put(a[i], result.get(a[i])+ 1);
	    	else
	    		result.put(a[i], 1L);
	    	divisors.clear();
	    	divisors.putAll(nextDivisors);
	    	
	    }
	    
	    int Q = ip(br.readLine());
	    for(int q=0;q<Q;q++){
	    	int v = ip(br.readLine());
	    	if(result.containsKey(v))
	    		w.println(result.get(v));
	    	else
	    		w.println("0");
	    }
	    
	    
	    w.close(); 
	}
	
	public static int gcd(int a,int b){
		int temp=0;
		while(b!=0){
			temp = b;
			b = a%b;
			a = temp;
		}
		return a;
	}
	
	public static int ip(String s){
		return Integer.parseInt(s);
	}
}
