#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

priority_queue<ll> Q;
int main(){
  ll n,q,x,sum=0;
  cin>>n; assert(1<=n&&n<=1e5);
  while(n--){
      cin>>x; assert(1<=x&&x<=1e9);
      sum+=x; Q.push(x);
  }
  cin>>q; assert(1<=q&&q<=1e5);
  while(q--){
      cin>>x;  assert(1<=x&&x<=1e9);
      while(!Q.empty()){
	  ll p=Q.top(); if(p<x)break;
	  Q.pop(); sum-=p;
	  p%=x;
	  sum+=p; Q.push(p);
      }
      cout<<sum<<endl;
  }
  return 0;
}