//
//  na 2643.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/27.
//

#include <stdio.h>
#include <iostream>
#include <map>
#include <set>
typedef long long int ll;
using namespace std;
const int maxn = 1e5 + 5, maxdep = 17;
int n, q, lg2[maxn];
ll a[maxn], st[maxn][maxdep];
//set<pair<ll, int> > v[2];
//set<pair<ll, int> > *lv = &v[0], *nv = &v[1];
map<ll, ll> ans;
template<typename T> inline void rd(T &v){
    v = 0; char r = getchar();
    while(r - 48 >= 10u)
        r = getchar();
    while(r - 48 < 10u){
        v = (v << 3) + (v << 1) + (r ^ 48);
        r = getchar();
    }
}
template<typename T> void pd(T v){
    if(v < 10)
        putchar(int(v) ^ 48);
    else{
        pd(v / 10);
        putchar(int(v % 10) ^ 48);
    }
}
template<typename T> T gcd(T a, T b){ return b? gcd(b, a % b): a; }
inline void init_st(){
    for(int i = n; i; --i){
        st[i][0] = a[i];
        for(int j = 1; j < maxdep; ++j)
            st[i][j] = gcd(st[i][j - 1], st[min(n, i + (1 << (j - 1)))][j - 1]);
    }
    lg2[1] = 0;
    for(int i = 2; i <= n; ++i)
        lg2[i] = lg2[i >> 1] + 1;
}
inline ll query(int lt, int rt){
    int dep = lg2[rt - lt + 1];
    return gcd(st[lt][dep], st[rt - (1 << dep) + 1][dep]);
}
#ifdef MAC_OS_VERSION_11_0
//#define BRUTEFORCE
#endif
int main(){
    cin.tie(0)->sync_with_stdio(false);
    rd(n);
    for(int i = 1; i <= n; ++i){
        rd(a[i]);
//        cerr << "fin" << i << endl;
    }
    init_st();
//    nv->insert(make_pair(a[1], 1));
//    ans[a[1]] = 1;
//    for(int i = 2; i <= n; ++i){
//        swap(nv, lv);
//        nv->clear();
//        nv->insert(make_pair(a[i], 1));
//        for(auto iter = lv->begin(); iter != lv->end(); ++iter){
//            ll val = gcd(iter->first, a[i]);
//            int cnt = iter->second;
//            auto ptr = nv->lower_bound(make_pair(val, 0));
//            if(ptr != nv->end() && ptr->first == val){
//                cnt += ptr->second;
//                nv->erase(ptr);
//            }
//            nv->insert(make_pair(val, cnt));
//        }
//        for(auto iter = nv->begin(); iter != nv->end(); ++iter)
//            ans[iter->first] += iter->second;
//    }
    for(int i = 1; i <= n; ++i){
        ll v = a[i];
        int p = i, lp = i;
        while(true){
            p = lp;
            for(int j = maxdep - 1; j >= 0; --j)
                if(query(i, min(n, p + (1 << j) - 1)) == v && (p += 1 << j) > n)
                    break;
            p = min(p, n + 1);
            ans[v] += p - lp;
            if(p > n)
                break;
            v = query(i, lp = p);
        }
    }
#ifdef BRUTEFORCE
    for(int i = 1; i <= n; ++i)
        for(int j = i; j <= n; ++j)
            ans[query(i, j)]--;
    for(auto iter: ans)
        if(iter.second != 0)
            cerr << "WTH " << endl;
    return 0;
#endif
    rd(q);
    while(q--){
        ll x;
        rd(x);
        pd(ans[x]);
        putchar('\n');
    }
    return 0;
}