#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long a[100010];
int main() {
	int n;
	cin >> n;
	long long m = 0, ans = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		ans += a[i];
		if (m < a[i]) {
			m = a[i];
		}
	}
	int q;
	cin >> q;
	for (int i = 0; i < q; i++){
		long long x;
		cin >> x;
		if (x > m) {
			cout << ans << endl;
			continue;
		}
		else {
			m = 0;
			for (int j = 0; j < n; j++) {
				int na = a[j] % x;
				ans -= a[j] - na;
				a[j] = na;
				if (m < a[j]) {
					m = a[j];
				}
			}
			cout << ans << endl;
		}
	}
}