#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;


int main(){
  int N;
  cin >> N;
  vector<int> v;
  rep(i,N){
    int a;
    cin >> a;
    v.push_back(a);
  }

  vector<int> w;
  map<int,int> memo;
  int X = 0;
  while(true){
    X %= N;
    if(memo.count(X) != 0) break;
    memo[X] = w.size();
    w.push_back(X);
    X += v[X];
  }
  vector<int> w2;
  vector<ll> sum1, sum2;
  ll base = 0;
  rep(i,w.size()){
    base += v[w[i]];
    sum1.push_back(base);
  }
  base = 0;
  int st = (w[w.size()-1] + v[w[w.size()-1]])%N;
  REP(i,memo[st],w.size()){
    w2.push_back(w[i]);
    base += v[w[i]];
    sum2.push_back(base);
  }

  int Q;
  cin >> Q;
  rep(q,Q){
    ll K;
    cin >> K;
    K--;
    if(K < w.size()){
      cout << sum1[K] << endl;
    }else{
      ll sum = sum1[sum1.size()-1];
      K -= sum1.size();
      sum += (K/sum2.size()) * sum2[sum2.size()-1];
      sum += sum2[K%(sum2.size())];
      
      cout << sum << endl;
    }
  }
  
  return 0;
}