#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n; cin >> n;
  map<int, int> mp;
  while (n--) {
    int a; cin >> a;
    ++mp[a];
  }
  int q; cin >> q;
  int mae = INF;
  long long memo;
  while (q--) {
    int x; cin >> x;
    if (x >= mae) {
      cout << memo << '\n';
      continue;
    }
    long long ans = 0;
    map<int, int> nx;
    for (auto pr : mp) {
      long long val = pr.first % x;
      ans += val * pr.second;
      if (val > 0) nx[val] += pr.second;
    }
    cout << ans << '\n';
    mae = x;
    memo = ans;
    swap(mp, nx);
  }
  return 0;
}