#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << endl;
}

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    
    int N;
    cin >> N;

    vll A(N);
    REP(i, N) {
        cin >> A[i];
    }

    debug(A);

    vi T;
    vector<bool> used(N);

    int cur = 0;
    while(1) {
        T.pb(cur);

        if (used[cur]) break;
        used[cur] = true;

        cur += A[cur];
        cur %= N;
    }

    vi before_loop, loop;
    int ls = T.back();
    bool f = false;
    ll x = 0;
    for(auto &e: T) {
        if (f && e == ls) break;
        if (e == ls) {
            x = 0;
            f = true;
        }

        x += A[e];

        if (f) {
            loop.pb(x);
        } else {
            before_loop.pb(x);
        }
    }

    debug(before_loop)

    int Q; cin >> Q;
    REP(_, Q) {
        ll k; cin >> k;

        ll ans = 0;

        if (!before_loop.empty()) {
            if (k <= before_loop.size()) {
                print(before_loop[k - 1]);
                continue;
            } else {
                ans += before_loop.back();
                k -= before_loop.size();
            }
        }

        ll n = k / loop.size();
        ll r = k % loop.size();

        ans += n * loop.back();
        if (r > 0) ans += loop[r - 1];
        print(ans);
    }
}