#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<int> b;
  vector<bool> visited(n, false);
  int x = 0;
  while (true) {
    b.emplace_back(x);
    if (visited[x]) break;
    visited[x] = true;
    (x += a[x]) %= n;
  }
  int fro = b.back();
  b.pop_back();
  vector<int> loop;
  while (b.back() != fro) {
    loop.emplace_back(b.back());
    b.pop_back();
  }
  loop.emplace_back(fro);
  b.pop_back();
  reverse(ALL(loop));
  int p = b.size(), q = loop.size();
  // REP(i, p) cout << b[i] << " \n"[i + 1 == p];
  // REP(i, q) cout << loop[i] << " \n"[i + 1 == q];
  vector b_sum(p + 1, 0LL), loop_sum(q + 1, 0LL);
  REP(i, p) b_sum[i + 1] = b_sum[i] + a[b[i]];
  REP(i, q) loop_sum[i + 1] = loop_sum[i] + a[loop[i]];
  int Q; cin >> Q;
  while (Q--) {
    ll k; cin >> k;
    if (k <= p) {
      cout << b_sum[k] << '\n';
      continue;
    }
    ll ans = b_sum[p];
    k -= p;
    ll turn = k / q;
    ans += loop_sum[q] * turn;
    k -= turn * q;
    ans += loop_sum[k];
    cout << ans << '\n';
  }
  return 0;
}