#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n)    for (ll (i) = 0;   (i) < (n); ++(i))

ll dp[100100][42];

signed main() {

    int N; cin >> N;
    vector<ll> A(N);
    REP(i, N) cin >> A[i];

    REP(i, N) dp[i][0] = A[i];
    REP(j, 41) {
        REP(i, N) {
            ll inc = dp[i][j];                      // inc: i(mod N)から2^j回進めたときの増分
            int mod = (inc + i) % N;                // mod: 2^j回進めたあとのmod N
            dp[i][j + 1] = dp[i][j] + dp[mod][j];   // iから2^j進めてmodに行き, さらにmodから2^j進める
        }
    }

    int Q; cin >> Q;
    while (Q--) {
        ll k; cin >> k;
        int cur = 0;
        ll res = 0;
        for (int i = 0; i < 41; ++i) {
            if (k >> i & 1) {
                ll inc = dp[cur][i];
                int nxt = (inc + cur) % N;
                res += inc;
                cur = nxt;
            }
        }
        cout << res << endl;
    }

}