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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
map<int, long long> mp;
map<int, long long> mp2;
map<int, long long> ans;
map<int, long long>::iterator it;
int a[100010];
int gcd(int a, int b) {
  if (a < b) swap(a, b);
  while (b) {
    int temp = a % b;
    a = b;
    b = temp;
  }
  return a;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  ans[a[1]] = 1;
  mp[a[1]] = 1;
  for (int i = 2; i <= n; i++) {
    int x = a[i];
    ans[x]++;
    mp2[x]++;
    for (it = mp.begin(); it != mp.end(); it++) {
      int v = gcd(x, it->first);
      ans[v] += it->second;
      mp2[v] += it->second;
    }
    mp.clear();
    for (it = mp2.begin(); it != mp2.end(); it++) {
      mp[it->first] = it->second;
    }
    mp2.clear();
  }
  int Q;
  scanf("%d", &Q);
  for (int i = 0; i < Q; i++) {
    int x;
    scanf("%d", &x);
    cout << ans[x] << endl;
  }
  return 0;
}