#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

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;}

const ll INF=1e18;

int main(){
    ll n;
    cin >> n;
    vector<ll> a(n),to(n);
    vector<vector<pll>> lca(50,vector<pll>(n));
    rep(i,n){
        cin >> a[i];
    }
    for(ll i=0;i<n;i++){
        ll p=i+a[i];
        to[i]=p;
    }
    for(ll i=0;i<50;i++){
        if(i==0){
            rep(j,n){
                lca[i][j].fi=to[j]%n;
                lca[i][j].se=a[j];
            }
            continue;
        }
        rep(j,n){
            lca[i][j].fi=lca[i-1][lca[i-1][j].fi].fi;
            lca[i][j].se=lca[i-1][j].se+lca[i-1][lca[i-1][j].fi].se;
        }
    }
    ll q;
    cin >> q;
    vector<ll> db(50);
    ll v=1;
    rep(i,50){
        db[i]=v;
        v*=2;
    }
    /*rep(i,50){
        rep(j,n){
            if(j) cout << " ";
            cout << lca[i][j].se;
        }
        cout << endl;
    }*/
    rep(i,q){
        ll k;
        cin >> k;
        vector<ll> t(50);
        ll num=49;
        while(k){
            if(k>=db[num]){
                k-=db[num];
                t[num]=1;
            }
            num--;
        }
        ll ans=0;
        ll r=0;
        rep(j,50){
            if(t[j]){
                ans+=lca[j][r].se;
                r=lca[j][r].fi;
            }
        }
        cout << ans << endl;
    }
}