#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int N;
    cin >> N;
    ll A[N];
    rep(i, N) cin >> A[i];
    int p[N];
    rep(i, N) p[i] = (i+A[i])%N;
    vector<int> ids;
    bool used[N];
    fill(used, used+N, false);
    int now = 0;
    while(!used[now]){
        ids.pb(now);
        used[now] = true;
        now = p[now];
    }
    bool flag = false;
    vector<int> pre, loop;
    for(auto &e: ids){
        if(e == now) flag = true;
        if(!flag) pre.pb(e);
        else loop.pb(e);
    }
    ll x = sz(pre), y = sz(loop);
    ll sum1[x+1], sum2[y+1];
    sum1[0] = sum2[0] = 0;
    rep(i, x) sum1[i+1] = sum1[i]+A[pre[i]];
    rep(i, y) sum2[i+1] = sum2[i]+A[loop[i]];
    int Q;
    cin >> Q;
    rep(i, Q){
        ll K;
        cin >> K;
        ll ans;
        if(K < x) ans = sum1[K];
        else{
            ll i = (K-x)/y, j = (K-x)%y;
            ans = sum1[x]+sum2[y]*i+sum2[j];
        }
        cout << ans << endl;
    }
}