#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

int main(){
    int N;cin>>N;
    vector<ll> A(N);
    ll S=0;
    priority_queue<ll> que;
    REP(i,N){
        cin>>A[i];
        S+=A[i];
        que.push(A[i]);
    }
    int Q;cin>>Q;
    REP(i,Q){
        ll X;cin>>X;
        while(que.top()>=X){
            ll K=que.top();que.pop();
            S-=K-K%X;
            K%=X;
            que.push(K);
        }
        cout<<S<<endl;
    }
}