#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;

	ll A[100000][40];
	rep(i, N) cin >> A[i][0];
	rep(j, 39) {
		rep(i, N) {
			A[i][j + 1] = A[i][j] + A[(i + A[i][j]) % N][j];
		}
	}

	int Q;
	cin >> Q;
	rep(i, Q) {
		ll K;
		cin >> K;

		ll kotae = 0;
		rep(j, 40) {
			if (K >> j & 1) {
				kotae += A[0][j];
			}
		}
		co(kotae);
	}



	Would you please return 0;
}