#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 5e5+10;
ll a[MAXN];
ll gcd(ll a,ll b){
	if(b==0)return a;
	return gcd(b,a%b);
}
struct node{
	int l,r;
	ll g;
}tree[MAXN<<2];
#define ls(p)(p<<1)
#define rs(p)(p<<1|1)
void build(int p,int l,int r){
	tree[p].l=l,tree[p].r=r;int mid=(l+r)>>1;
	if(l==r){
		tree[p].g=a[l];
		return ;
	}
	build(ls(p),l,mid),build(rs(p),mid+1,r);
	tree[p].g=gcd(tree[ls(p)].g,tree[rs(p)].g);
}
ll query(int p,int L,int R){
	int l=tree[p].l,r=tree[p].r,mid=(l+r)>>1;
	if(L<=l&&r<=R)return tree[p].g;
	if(L<=mid&&mid<R)return gcd(query(ls(p),L,R),query(rs(p),L,R));
	if(L<=mid)return query(ls(p),L,R);
	return query(rs(p),L,R);
}
int n,q;
int calc(int LL,int L,ll G){
	int l=L,r=n,re=0;
	while(l<=r){
		int mid=(l+r)>>1;
		if(query(1,LL,mid)==G)re=mid,l=mid+1;
		else r=mid-1;
	}
	return re;
}
map<ll,ll>ans;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%lld",&a[i]);
	build(1,1,n);
	for(int i=1;i<=n;++i){
		int r=i;
		while(r<=n){
			ll G=query(1,i,r);
			int nxt=calc(i,r,G);
			ans[G]+=nxt-r+1;
			r=nxt+1;
		}
	}
	scanf("%d",&q);
	while(q--){
		ll x;scanf("%lld",&x);
		printf("%lld\n",ans[x]);
	}
	return 0;
}