#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<queue>

using namespace std;

#define int long long
#define endl "\n"

const long long INF = (long long)1e18;
const long long MOD = 1'000'000'007; 

string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YES":"NO";}



signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	int N, q, sum = 0, maximum = 0;
	// priority_queue<int,vector<int>,greater<int>> Q;
	priority_queue<int> Q;
	vector<int> A, X;
	
	cin>>N;
	
	A.assign(N,0);
	
	for(int i = 0; i < N; i++){
		cin>>A[i];
		sum += A[i];
		Q.push(A[i]);
	}
	
	cin>>q;
	
	X.assign(q,0);
	
	for(int i = 0; i < q; i++){
		cin>>X[i];
		
			// cout<<Q.top()<<" "<<X[i]<<endl;
		while(Q.top() >= X[i]){
			// cout<<Q.top()<<" "<<X[i]<<endl;
			int x = Q.top(); Q.pop();
			sum -= x - x%X[i];
			Q.push(x%X[i]);
		}
		
		cout<<sum<<endl;
	}
	
	return 0;
}