// yukicoder 885 アマリクエリ
// 2019.9.21 bal4u

#include <stdio.h>

typedef long long ll;

#if 1
int getchar_unlocked(void);
int putchar_unlocked(int c);
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void outL(ll n) { // 非負整数の表示（出力）
	int i; char b[30];

	if (!n) pc('0');
	else {
		i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
		while (i--) pc(b[i]);
	}
	pc('\n');
}

#define QSIZE 100010

#define PARENT(i) ((i)>>1)
#define LEFT(i)   ((i)<<1)
#define RIGHT(i)  (((i)<<1)+1)

int que[QSIZE+5];
int qsize;

void max_heapify(int i) {
	int l, r, max;

	l = LEFT(i), r = RIGHT(i);
	if (l < qsize && que[l] > que[i]) max = l; else max = i;
	if (r < qsize && que[r] > que[max]) max = r;
	if (max != i) {
		int qt = que[i]; que[i] = que[max], que[max] = qt;
		max_heapify(max);
	}
}

void deq() {
	que[0] = que[--qsize];
	max_heapify(0);
}

void enq(int t) {
	int i, max;

	i = qsize++;
	que[i] = t;
	while (i > 0 && que[max = PARENT(i)] < que[i]) {
		int qt = que[i]; que[i] = que[max], que[max] = qt;
		i = max;
	}
}
	
int main()
{
	int i, t, N, A, Q, X; ll s;
	
	N = in();
	s = 0; while (N--) {
		A = in(), s += A;
		enq(A);
	}
	Q = in(); while (Q--) {
		X = in();
		while ((t = que[0]) >= X) {
			s -= t, t %= X, deq(), enq(t), s += t;
		}
		outL(s);
		if (s == 0) break;
	}
	if (Q > 0) while (Q--) pc('0'), pc('\n');
	return 0;
}