#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll g[100005][25];
int n,q;
ll a[100005];
int getd(int x){
	int cnt=0;
	while(x){
		x>>=1;
		cnt++;
	}
	return cnt-1;
}
int gg(int l,int r){
	int d=getd(r-l+1);
	return __gcd(g[l][d],g[r-(1<<d)+1][d]);
}
map<ll,ll>ans;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	for(int i=1;i<=n;i++)g[i][0]=a[i];
	for(int j=1;j<20;j++)for(int i=1;i+(1<<j)-1<=n;i++)g[i][j]=__gcd(g[i][j-1],g[i+(1<<(j-1))][j-1]);
	for(int i=1;i<=n;i++){
		int lp=i-1;
		ll lv=a[i];
		while(lp<n){
			int L=lp+1,R=n,b=lp+1;
			while(L<=R){
				int mid=(L+R)/2;
				if(gg(i,mid)==lv)L=mid+1,b=mid;
				else R=mid-1;
			} 
			ans[lv]+=b-lp;
			if(b<n)lv=gg(i,b+1);
			lp=b;
		}
	}
	scanf("%d",&q);
	while(q--){
		ll x;
		scanf("%lld",&x);
		printf("%lld\n",ans[x]);
	}
	return 0;
	//quod erat demonstrandum
}