import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

mx = 10**12
maxlv = mx.bit_length()

n = II()
aa = LI()
to = [[-1]*n for _ in range(maxlv)]
cost = [[0]*n for _ in range(maxlv)]
for i, a in enumerate(aa):
    to[0][i] = (i+a)%n
    cost[0][i] = a

for lv in range(maxlv-1):
    for j in range(n):
        j0 = to[lv][j]
        j1 = to[lv][j0]
        to[lv+1][j] = j1
        cost[lv+1][j] = cost[lv][j]+cost[lv][j0]

for _ in range(II()):
    k = II()
    ans = 0
    j = 0
    for lv in range(maxlv):
        if k >> lv & 1:
            ans += cost[lv][j]
            j = to[lv][j]
    print(ans)