#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline i64 read_int() {
    i64 x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}

const int MAX_N = 100000 + 5;

i64 gcd(i64 a, i64 b) {
    for (i64 t; b; t = a, a = b, b = t % a);
    return a;
}

int N, Q;
int nb, nc;
i64 a[MAX_N];
i64 bv[MAX_N], cv[MAX_N]; 
int bl[MAX_N], cl[MAX_N];
map<i64,i64> ans;

int main() {
    N = read_int();
    for (int i = 1; i <= N; i ++) {
        a[i] = read_int();
        nc = 1;
        cv[0] = a[i];
        cl[0] = i;
        i64 t = a[i];
        for (int j = 0; j < nb; j ++) {
            t = gcd(bv[j], t);
            if (t == cv[nc - 1]) {
                cl[nc - 1] = bl[j];
            } else {
                cv[nc] = t;
                cl[nc] = bl[j];
                nc ++;
            }
        }
        nb = nc;
        for (int j = 0, la = i + 1; j < nc; j ++) {
            bv[j] = cv[j];
            bl[j] = cl[j];
            if (ans.find(cv[j]) == ans.end()) {
                ans[cv[j]] = la - cl[j];
            } else {
                ans[cv[j]] += la - cl[j];
            }
            la = cl[j];
        }
    }
    for (Q = read_int(); Q --; ) {
        i64 x = read_int();
        if (ans.find(x) == ans.end()) {
            printf("0\n");
        } else {
            printf("%lld\n", ans[x]);
        }
    }
    return 0;
}