def solve():
  ans = 0
  N = int(input())
  A = list(map(int, input().split()))
  lis = [0]
  visited = [-1]*N
  r = 0
  cnt = 0
  while visited[r]==-1:
    visited[r] = cnt
    lis.append(lis[-1]+A[r])
    r = (r+A[r])%N
    cnt += 1
  cycle = cnt - visited[r]
  add_per_cycle = lis[-1]-lis[-cycle-1]
  first = visited[r]
  Q = int(input())
  ans = []
  for i in range(Q):
    k = int(input())
    if k<=first:
      ans.append(lis[k])
    else:
      ans.append(lis[first+(k-first)%cycle]+(k-first)//cycle*add_per_cycle)
  return ans
print(*solve(), sep='\n')