#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
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; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;cin >> n;
    vector<ll> a(n);
    REP(i,n){
        cin >> a[i];
    }
    vector<vector<int>> d(41,vector<int>(n));
    vector<vector<ll>> v(41,vector<ll>(n));
    REP(i,n){
        d[0][i]=(i+a[i])%n;
        v[0][i]=a[i];
    }
    REP(i,40){
        REP(j,n){
            d[i+1][j]=d[i][d[i][j]];
            v[i+1][j]=v[i][j]+v[i][d[i][j]];
        }
    }
    int q;cin >> q;
    while(q--){
        ll k;cin >> k;
        int now=0,cnt=0;
        ll ans=0;
        while(k){
            if(k&1){
                ans+=v[cnt][now];
                now=d[cnt][now];
            }
            cnt++;
            k>>=1;
        }
        cout << ans << endl;
    }
}