#include <bits/stdc++.h>

using namespace std;

#define int long long
#define x first
#define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 100010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, q, a[N];
int stb[N][20], tot;
PII query[N];

void Init()
{
    for (int i = 1; i <= n; i ++) stb[i][0] = a[i];
    for (int k = 1; k < 20; k ++)
        for (int i = 1; i + (1 << k) - 1 <= n; i ++)
            stb[i][k] = __gcd(stb[i][k - 1], stb[i + (1 << k) - 1][k - 1]);
}

int Query(int l, int r)
{
    int k = __lg(r - l + 1);
    return __gcd(stb[l][k], stb[r - (1 << k) + 1][k]);
}

vector<PII> segs[N];
int ans[N];

unordered_map<int, int> mp;

signed main()
{
    read(n);
    for (int i = 1; i <= n; i ++) read(a[i]);
    read(q);
    for (int i = 1; i <= n; i ++)
    {
        read(query[i].x), query[i].y = i;
        if (!mp.count(query[i].x)) mp[query[i].x] = ++ tot;
    }
    Init();

    for (int i = 1; i <= n; i ++)
    {
        int idx = i;
        while (idx <= n)
        {
            int l = idx, r = n, res = -1;
            while (l <= r)
            {
                int mid = l + r >> 1;
                if (Query(i, mid) == Query(i, idx)) res = mid, l = mid + 1;
                else r = mid - 1;
            }
            if (mp.count(Query(i, res)))
                ans[mp[Query(i, res)]] += res - idx + 1;
            segs[i].emplace_back(idx, res), idx = res + 1;
        }
    }

    for (int i = 1; i <= n; i ++)
        cout << ans[mp[query[i].x]] << '\n';
    cout << '\n';

    return 0;
}