#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}

const int MAX_N = 112345;
ll f[MAX_N][40];
ll g[MAX_N][40];

int main2() {
  int N = nextLong();
  vector<int> A(N);
  REP(i, N) A[i] = nextLong();

  REP(i, N) f[i][0] = (i + A[i]) % N;
  REP(i, N) g[i][0] = (i + A[i]) / N;
  for (int k = 1; k < 40; k++) {
    REP(i, N) {
      f[i][k] = f[f[i][k-1] % N][k-1];
      g[i][k] = g[i][k-1] + g[f[i][k-1] % N][k-1];
    }
  }
  int Q = nextLong();
  REP(qi, Q) {
    ll K = nextLong();
    ll r = 0;
    ll q = 0;
    REP(b, 40) if (K >> b & 1) {
      q += g[r][b];
      r = f[r][b];
    }
    ll ans = q * N + r;
    cout << ans << '\n';
  }
  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}