#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vector<int> A(N);
	set< pair<int, int> > st;
	int sum = 0;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		sum += A[i];
		st.emplace(A[i], i);
	}
	int Q;
	cin >> Q;
	vector<int> X(Q);
	vector<int> res(Q);
	for (int i = 0; i < Q; i++) {
		cin >> X[i];
		pair<int, int> p = make_pair(X[i], -1);

		auto a = st.lower_bound(p);
		vector<pair<int, int> > vp;
		while (a != st.end()) {
			vp.push_back(*a);
			a++;
		}
		for (int j = 0; j < vp.size(); j++) {
			int t = vp[j].first;
			st.erase(vp[j]);
			vp[j].first %= X[i];
			st.insert(vp[j]);
			sum -= t - vp[j].first;
		}
		res[i] = sum;
	}
	for (int i = 0; i < Q; i++) {
		cout << res[i] << endl;
	}

	

}