#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }


signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	int n;
	cin >> n;
	vector<ll> a(n);
	rep(i, n) cin >> a[i];
	vector<ll> vis(n, -1);
	vector<ll> num;
	ll now = 0; ll per = 0, pl = 0;
	while (true) {
		if (vis[now % n] != -1) {
			per = num.size() - vis[now % n];
			pl = now - num[vis[now % n]];
			break;
		}
		vis[now % n] = num.size();
		num.pb(now);
		now += a[now % n];
	}
	ll bor = num.size() - 1;
	int q;
	cin >> q;
	while (q--) {
		ll k;
		cin >> k;
		if (k <= bor) cout << num[k] << '\n';
		else {
			ll dif = (k - bor - 1) / per + 1;
			cout << dif * pl + num[k - dif * per] << '\n';
		}
	}
}