// Problem: C. gcd
// Contest: undefined - NOIP2024训练赛 15
// URL: http://noi.ac/contest/1167/problem/2643
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 2e5 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q;
int s[N], st[N][22];

map<int, int> ans;

int gcd(int a, int b)
{
	if(!b) return a;
	return gcd(b, a % b);
}

int calc(int l, int r)
{
	int k = log2(r - l + 1);
	return gcd(st[l][k], st[r - (1 << k) + 1][k]);
}

inline void init()
{
	for(int j = 1; j <= 20; j ++)
		for(int i = 1; i + (1 << j) - 1 <= n; i ++) 
			st[i][j] = gcd(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
}

int solve(int k, int l, int r, int g)
{
	if(l == r) return l;
	if(l + 1 == r) 	return calc(k, r) == g ? r : l;
	int mid = l + r >> 1;
	if(calc(k, mid) == g) return solve(k, mid, r, g);
	else return solve(k, l, mid - 1, g);
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i ++) cin >> st[i][0];
	init();
	for(int i = 1; i <= n; i ++)
	{
		int l = i;
		while(l <= n)
		{
			int r = solve(i, l, n, calc(i, l));
			ans[calc(i, l)] += (r - l + 1), l = r + 1;
		}
	}
	cin >> q;
	while(q --)
	{
		int x; cin >> x;
		cout << ans[x] << '\n';
	}
	return 0;
}