#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<int> a(n);
  REP (i, n) cin >> a[i];

  int len = -1;
  int s = -1;
  vector<int> vis(n, -1);
  int x = 0;
  for (int i = 0; ; i++) {
    if (vis[x] != -1) {
      s = vis[x];
      len = i - s;
      break;
    }
    vis[x] = i;
    x += a[x];
    x %= n;
  }

  vector<long long> pref;
  vector<long long> cyc;
  x = 0;
  for (int i = 0; i < s + len; i++) {
    if (i < s) {
      long long tmp = pref.size() ? pref.back() : 0;
      pref.push_back(tmp + a[x]);
    } else {
      long long tmp = cyc.size() ? cyc.back() : 0;
      cyc.push_back(tmp + a[x]);
    }
    x += a[x];
    x %= n;
  }

  int q;
  cin >> q;
  while (q--) {
    long long k;
    cin >> k;
    --k;

    long long ret = 0;
    if (k < s) {
      ret = pref[k];
    } else {
      if (pref.size())
        ret += pref.back();
      k -= s;
      ret += k / len * cyc.back();
      ret += cyc[k % len];
    }
    cout << ret << endl;
  }
  
  return 0;
}