#include <cstdio>
#include <cmath>
#include <map>
using namespace std;
long long gcd(long long a, long long b) {
    if (b == 0) {
        return a;
    }
    return gcd(b, a % b);
}
struct GCDRMQ {
    int n;
    long long a[100010];
    long long f[20][100010];
    void init() {
        for (int i = 1; i <= n; i++) {
            f[0][i] = a[i];
        }
        for (int i = 1; i < 20; i++) {
            for (int j = 1; j <= n; j++) {
                if (j + (1 << (i - 1)) > n) {
                    f[i][j] = f[i - 1][j];
                } else {
                    f[i][j] = gcd(f[i - 1][j], f[i - 1][j + (1 << (i - 1))]);
                }
            }
        }
    }
    long long query(long long l, long long r) {
        int i = log2(r - l + 1);
        return gcd(f[i][l], f[i][r - (1 << i) + 1]);
    }
} gr;
int n, q;
long long a[100010], x;
map<long long, long long> mp;
pair<int, long long> findr(int l, int r) {
    long long now = gr.query(l, r);
    int L = r, R = n, ans;
    while (L <= R) {
        int mid = (L + R) >> 1;
        if (gr.query(l, mid) == now) {
            ans = mid;
            L = mid + 1;
        } else {
            R = mid - 1;
        }
    }
    return {ans, now};
}
int main() {
    scanf("%d", &n);
    gr.n = n;
    for (int i = 1; i <= n; i++) {
        scanf("%lld", &a[i]);
        gr.a[i] = a[i];
    }
    gr.init();
    for (int i = 1; i <= n; i++) {
        for (int j = i - 1; j < n; j++) {
            pair<int, long long> res = findr(i, j + 1);
            int r = res.first;
            long long v = res.second;
            mp[v] += r - j;
            j = r;
        }
    }
    scanf("%d", &q);
    for (int i = 1; i <= q; i++) {
        scanf("%d", &x);
        if (!mp.count(x)) printf("0\n");
        else printf("%lld\n", mp[x]);
    }
    return 0;
}