#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
  if (b == 0) return a;
  return (a % b == 0 ? b : GCD(b, a % b));
}
long long POW(long long base, long long exp) {
  long long val;
  val = 1;
  while (exp > 0) {
    if (exp % 2 == 1) {
      val = (val * base) % 1000000007;
    }
    base = (base * base) % 1000000007;
    exp = exp / 2;
  }
  return val;
}
int a[100005];
map<int, long long> ans;
map<int, int> mp, temp;
pair<int, int> pp;
int main() {
  int n, i, q, x, gcd;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  for (i = 0; i < n; i++) {
    temp.clear();
    for (map<int, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
      gcd = GCD(a[i], it->first);
      if (temp.count(gcd) == 1) {
        temp[gcd] += it->second;
      } else {
        temp[gcd] = it->second;
      }
    }
    if (temp.count(a[i]) == 1) {
      temp[a[i]] += 1;
    } else {
      temp[a[i]] = 1;
    }
    mp.clear();
    for (map<int, int>::iterator it = temp.begin(); it != temp.end(); ++it) {
      pp.first = it->first;
      pp.second = it->second;
      if (ans.count(pp.first) == 1) {
        ans[pp.first] = ans[pp.first] + pp.second;
      } else {
        ans[pp.first] = pp.second;
      }
      mp.insert(pp);
    }
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &x);
    cout << ans[x] << endl;
  }
  return 0;
}
