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
from sys import stdin
import math
from collections import defaultdict

input = stdin.readline

# n, k = map(int, input().split(" "))
# l = list(map(int, input().split(" ")))

n = int(input())
l = list(map(int, input().split(" ")))

k = math.ceil(math.log2(n))
dp = [[0] * k for i in range(2 ** k)]


def make_sparse(l, n, k):
    """Making sparse table, replace max with needed function like[GCD, Min, max, sum]"""
    for i in range(n):
        dp[i][0] = l[i]

    for j in range(1, k + 1):
        i = 0
        while i + (1 << j) <= n:
            dp[i][j] = math.gcd(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1])
            i += 1


def querys(l, r):
    j = int(math.log2(r - l + 1))
    return math.gcd(dp[l][j], dp[r - (1 << j) + 1][j])


make_sparse(l, n, k)
d = defaultdict(int)
g = defaultdict(int)
d[l[0]] = 1
g[l[0]] = 1
for i in range(1, n):
    t = defaultdict(int)
    t[l[i]] = 1
    g[l[i]]+=1
    for k, v in d.items():
        gcd = math.gcd(k, l[i])
        t[gcd] += v
        g[gcd] += v
    d = t

for i in range(int(input())):
    a = g[int(input())]
    if not a:
        print(0)
    else:
        print(a)
