#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//constexpr ll mod = 998244353;
//const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);



int nex[1 << 17][40];
ll cost[1 << 17][40];
void solve() {
	int n; cin >> n;
	vector<ll> a(n);
	rep(i, n)cin >> a[i];
	rep(i, n) {
		nex[i][0] = (i + a[i]) % n;
		cost[i][0] = a[i];
	}
	rep(j, 39)rep(i, n) {
		nex[i][j + 1] = nex[nex[i][j]][j];
		cost[i][j + 1] = cost[i][j] + cost[nex[i][j]][j];
	}
	int q; cin >> q;
	rep(i, q) {
		ll c; cin >> c;
		int cur = 0;
		ll ans = 0;
		per(j, 40) {
			if (c&(1ll << j)) {
				ans += cost[cur][j];
				cur = nex[cur][j];
			}
		}
		//cout << "ans is ";
		cout << ans << "\n";
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	stop
		return 0;
}