/* -*- coding: utf-8 -*-
 *
 * 1097.cc:  No.1097 Remainder Operation - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int BN = 40;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N], rs[MAX_N][BN];
ll ps[MAX_N][BN];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < n; i++) {
    int r = i + as[i];
    rs[i][0] = r % n;
    ps[i][0] = r / n;
  }

  for (int k = 0; k < BN - 1; k++)
    for (int i = 0; i < n; i++) {
      rs[i][k + 1] = rs[rs[i][k]][k];
      ps[i][k + 1] = ps[i][k] + ps[rs[i][k]][k];
    }

  int q;
  scanf("%d", &q);
  while (q--) {
    ll ki;
    scanf("%lld", &ki);

    int r = 0;
    ll p = 0;
    for (int k = BN - 1; k >= 0; k--)
      if ((ki >> k) & 1) {
	p += ps[r][k];
	r = rs[r][k];
      }

    printf("%lld\n", p * n + r);
  }
  return 0;
}