#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 123450
#define MAX 50
#else
#define SIZE 123450
#define MAX 50
#endif

int N,K,Q,A[SIZE];
int MOVE[SIZE][MAX],SCORE[SIZE][MAX];

void solve() {
    cin>>N;
    REP(i,N)cin>>A[i];
    cin>>Q;
    REP(i,N) {
        MOVE[i][0] = (i+A[i])%N;
        SCORE[i][0] = A[i];
    }
    REP(j,MAX-1)REP(i,N) {
        MOVE[i][j+1] = MOVE[MOVE[i][j]][j];
        SCORE[i][j+1] = SCORE[i][j] + SCORE[MOVE[i][j]][j];
    }
    while(Q--) {
        cin>>K;
        int X = 0;
        RREP(i,MAX-1) {
            if (K & 1LL<<i) {
                X += SCORE[X%N][i];
            }
        }
        out("%lld\n",X);
    }
}