#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll n; scanf("%lld", &n);
	vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
	vector<vector<ll>> to(60, vector<ll>(n)), sum(60, vector<ll>(n));
	for (int i = 0; i < n; i++) {
		ll nx = (i + a[i]) % n;
		to[0][i] = nx;
		sum[0][i] = a[i];
	}
	for (int i = 1; i < 60; i++) for (int j = 0; j < n; j++) to[i][j] = to[i - 1][to[i - 1][j]], sum[i][j] = sum[i - 1][j] + sum[i - 1][to[i - 1][j]];
	int kkt; scanf("%d", &kkt);
	while (kkt--) {
		ll k; scanf("%lld", &k);
		ll cur = 0;
		ll res = 0;
		for (int i = 59; i >= 0; i--) {
			if (k >> i & 1) {
				res += sum[i][cur];
				cur = to[i][cur];
			}
		}
		printf("%lld\n", res);
		
	}
	return 0;
}