#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;
//using namespace atcoder;


void solve(){
	ll n;
	cin>>n;
	vector<ll>a(n);
	rep(i,n)cin>>a[i];
	vector<vector<ll>>dp(60,vector<ll>(n,-1)),sum(60,vector<ll>(n));
	ll x=0;
	rep(i,n){
		dp[0][x%n]=(x+a[x%n])%n;
		sum[0][x%n]=a[x%n];
		x=(x+a[x%n])%n;
	}
	rep(i,59){
		rep(j,n){
			if(dp[i][j]==-1)dp[i+1][j]=dp[i][j];
			else{
				dp[i+1][j]=dp[i][dp[i][j]];
				sum[i+1][j]=sum[i][j]+sum[i][dp[i][j]];
			}
		}
	}
	int q;
	cin>>q;
	while(q--){
		ll k;
		cin>>k;
		int cur=0;
		ll ans=0;
		rep(i,60){
			if(k&(1LL<<i)){
				ans+=sum[i][cur];
				cur=dp[i][cur];
			}
		}
		cout<<ans<<"\n";
	}
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}