Milly and Pranjul are playing a game in which Pranjul will give an index of a chocolate. Then, Milly has to tell him the box number in which that chocolate is in. There are N such boxes and Ci chocolates are there in i^th the box. Description of index is given below :

Suppose there are A1, A2 … AN chocolates in 1^st, 2^nd… N^th boxes respectively. So, indexing of chocolates in 1^st box will be from 1 to A1, similarly in 2^nd box indexing will be A1 + 1 to A2 … and indexing in N^th box will be from AN-1 + 1 to AN. 

Milly is blind folded so she can’t see the boxes. You are required to help her. 

Input

First line will contain N (No. of boxes). Next line will contain N space separated integers denoting Ci, the number of chocolates in i^th box.
Next line will contain Q (No. of times Pranjul will ask her). Then each next Q lines will contain the asked index I.

Output
For every query, print in a new line : the box number in which that index of chocolate is in.
Constraints

1 ≤ N, Q ≤ 10^5
1 ≤ Ci ≤ 10
1 ≤ ∑ Ci ≤ 10^6
1 ≤ I ≤ ∑ Ci

SAMPLE INPUT
2
2 3
2
2
4

SAMPLE OUTPUT
1
2

Explanation

First Box will have the indexes : 1, 2 
Second Box will have the indexes : 3, 4, 5
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''

def total(lis):
    cum_sum = 0
    for i in lis:
        cum_sum = cum_sum + i
        yield cum_sum


def bin_srch(cumu_sum, que):
    if que <= cumu_sum[0]:
        return 1
    
    if que > cumu_sum[len(cumu_sum)-2]:
        return len(cumu_sum)
    
    first = 0
    last = len(cumu_sum)-1
    
    while first <= last:
        #print 'first'
        #print first
        #print 'last'
        #print last
        mid = (first+last)/2
        if cumu_sum[mid] < que and cumu_sum[mid+1] >= que:
            return mid+2
        else:
            if cumu_sum[mid] < que:
                first = mid
            else:
                last = mid


n = int(raw_input())
chocs = map(int, raw_input().split())

nques = int(raw_input())

ques = [int(raw_input()) for _ in xrange(nques)]

#print ques
cumu_sum = list(total(chocs))
#print cumu_sum
#print chocs

for que in ques:
    #print que
    #print ''
    print bin_srch(cumu_sum, que)