#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;



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

	int N; cin >> N;
	vector<VI> dp(N, VI(40));
	VI A(N);
	REP(i, N)cin >> A[i];

	REP(i, N) {
		dp[i][0] = A[i];
	}
	FOR(j, 1, 40) {
		REP(i, N) {
			dp[i][j] = dp[i][j - 1] + dp[(dp[i][j - 1]+i) % N][j - 1];
			//if(j<=5)cout << i << " " << j << " " << dp[i][j] << endl;
		}
	}


	int Q; cin >> Q;
	while (Q--) {
		int K; cin >> K;
		int now = 0;
		int j = 0;
		while (K) {
			if (K % 2) {
				//cout << now << " " << dp[now%N][j] << " " << j << endl;
				now += dp[now%N][j];
			}
			K /= 2;
			j++;
		}
		cout << now << '\n';
	}


	return 0;
}