#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint n, Q;
llint a[200005];
llint succ[45][200005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i];
	
	for(int i = 0; i < n; i++) succ[0][i] = a[i];
	for(int i = 1; i < 45; i++){
		for(int j = 0; j < n; j++){
			succ[i][j] = succ[i-1][j] + succ[i-1][(j+succ[i-1][j])%n];
		}
	}
	
	cin >> Q;
	llint k;
	for(int i = 1; i <= Q; i++){
		cin >> k;
		llint x = 0;
		for(int j = 44; j >= 0; j--){
			if(k & (1LL<<j)){
				x += succ[j][x%n];
			}
		}
		cout << x << endl;
	}
	
	return 0;
}