/*       递推算出所有GCD值，map统计*/#include <iostream>#include <vector>#include <map>using namespace std;#define ll long longconst int MAXN = 100009;int n, m;ll x;map<ll , ll > sum, record[2];map<ll, ll>::iterator it;ll gcd (ll a, ll b) {    return b == 0 ? a : gcd (b, a % b);}int main() {    ios::sync_with_stdio (0);    cin >> n;    int roll = 1;    for (int i = 1; i <= n; i++, roll ^= 1) {        cin >> x;        record[roll].clear();        record[roll][x]++, sum[x]++;        for (it = record[roll ^ 1].begin(); it != record[roll ^ 1].end(); ++it) {            ll tem = gcd (x, (*it).first);            sum[tem] += (*it).second;            record[roll][tem] += (*it).second;        }    }    cin >> m;    for (int i = 1; i <= m; i++) {        cin >> x;        cout << sum[x] << endl;    }}