//////////////////  استعن بالله ولا تعجز  //////////////////
#include<bits/stdc++.h>
using namespace std;
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define ll long long int
#define el endl
//======================================================
void File() {
#ifndef ONLINE_JUDGE
    freopen("In.txt", "r", stdin);
    freopen("Out.txt", "w", stdout);
#endif
}
//================================================
int ign=0;
ll merge(ll val,ll res) {
    return __gcd(res,val);
}
//================================================
vector<vector<ll>>spars_table;

void SparseTable(const vector<ll>&v) {
    const int n=v.size();
    spars_table.assign(__lg(n)+1,vector<ll>(n));
    for(int i=0;i<n;i++)
        spars_table[0][i]=v[i];
    for (int i = 1; (1<<i) <= n; ++i) {
        for (int j = 0; j+(1<<i) <= n; ++j) {
            spars_table[i][j] = merge(spars_table[i-1][j],spars_table[i-1][j+(1<<i)/2]);
        }
    }
}
//================================================
ll Query(int l, int r) {
    ll len=r-l+1;
    ll res=ign;
    for(int i=0;(1<<i)<=len;i++) {
        if (len>>i&1)
            res=merge(spars_table[i][l],res),l+=(1<<i);
    }
    return res;
}

//================================================
void solve() {
    int n; cin>>n;
    vector<ll> v(n);
    for (int i = 0; i < n; i++)
        cin>>v[i];
    SparseTable(v);
    for (auto & i : spars_table) {
        sort(i.rbegin(), i.rend());
    }
    int q; cin>>q;
    while (q--) {
        ll x; cin>>x;
        ll res=0;
        map<ll,ll> mp;
        for (int i =0;i<spars_table.size(); ++i) {
            for (int j = 0; j<spars_table[i].size(); ++j) {
                if (spars_table[i][j]==x and !mp[pow(2,i)])
                    res+=pow(2,i),mp[pow(2,i)]++;
                else if (spars_table[i][j]<x)
                    break;            }
        }
        cout<<res<<"\n";
    }

}

//======================================================
int main()
{
    File();
    speed
    int t=1;
    // cin>>t;
    while(t--) {
        solve();
    }

}