#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

int main() {
    cin>>N;
    vec a(N);
    mat dbl(N, vec(50)), num(N, vec(50));
    rep(i,N) {
        cin >> a[i];
        dbl[i][0] = (i + a[i])%N;
        num[i][0] = (i + a[i]) / N;
    }
    reps(k, 1, 50){
        rep(i,N) {
            dbl[i][k] = dbl[dbl[i][k-1]][k-1];
            num[i][k] = num[i][k-1] + num[dbl[i][k-1]][k-1];
        }
    }
    cin>>Q;
    rep(_,Q){
        cin>>K;
        int now = 0;
        ll n = 0;
        Rrep(i,50){
            if((K>>i)&1){
                n += num[now][i];
                now = dbl[now][i];
            }
        }
        cout<<now + N * n<<endl;
    }
}