#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int n, sz;
vector<ll> mx, sum, lazy;
ll a[1<<17];

void init(){
	sz=1;
	while(sz<n) sz<<=1;
	mx.resize(2*sz-1);
	sum.resize(2*sz-1);
	lazy.resize(2*sz-1, -1);
	for(int i=0; i<n; i++){
		mx[i+sz-1]=sum[i+sz-1]=a[i];
	}
	for(int i=sz-2; i>=0; i--){
		mx[i]=max(mx[2*i+1], mx[2*i+2]);
		sum[i]=sum[2*i+1]+sum[2*i+2];
	}
}

void eval(int k, int l, int r){
	if(lazy[k]!=-1){
		mx[k]=lazy[k];
		sum[k]=(r-l)*lazy[k];
		if(k<sz-1){
			lazy[2*k+1]=lazy[k];
			lazy[2*k+2]=lazy[k];
		}
	}
	lazy[k]=-1;
}

void update(int a, int b, ll x, int k, int l, int r){
	eval(k, l, r);
	if(r<=a || b<=l) return;
	if(a<=l && r<=b){
		lazy[k]=x;
		eval(k, l, r);
	}else{
		update(a, b, x, 2*k+1, l, (l+r)/2);
		update(a, b, x, 2*k+2, (l+r)/2, r);
		mx[k]=max(mx[2*k+1], mx[2*k+2]);
		sum[k]=sum[2*k+1]+sum[2*k+2];
	}
}

void update_mod(int a, int b, ll x, int k, int l, int r){
	eval(k, l, r);
	if(r<=a || b<=l || mx[k]<x) return;
	if(a<=l && r<=b && mx[k]*(r-l)==sum[k]){
		lazy[k]=mx[k]%x;
		eval(k, l, r);
	}else{
		update_mod(a, b, x, 2*k+1, l, (l+r)/2);
		update_mod(a, b, x, 2*k+2, (l+r)/2, r);
		mx[k]=max(mx[2*k+1], mx[2*k+2]);
		sum[k]=sum[2*k+1]+sum[2*k+2];
	}
}

ll sum_query(int a, int b, int k, int l, int r){
	eval(k, l, r);
	if(r<=a || b<=l) return 0;
	if(a<=l && r<=b) return sum[k];
	else return sum_query(a, b, 2*k+1, l, (l+r)/2)+sum_query(a, b, 2*k+2, (l+r)/2, r);
}

int main()
{
	cin>>n;
	for(int i=0; i<n; i++) scanf("%lld", &a[i]);
	init();
  int q; cin>>q;
	for(int i=0; i<q; i++){
		ll x; cin>>x;
		update_mod(0, n, x, 0, 0, sz);
		printf("%lld\n", sum_query(0, n, 0, 0, sz));
	}
	return 0;
}