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 bin(ci,ind,lower,upper):
	#print ci
	while(lower<=upper):
		if lower+1==upper or lower==upper:
			if ind<=ci[lower]:
				#print 'returning lower'
				return lower
			#print 'returing upper'
			return upper
		mid=(lower+upper)/2
		if ci[mid]>=ind and ci[mid-1]<ind:
			#print 'here'
			return mid
		elif ci[mid]>ind and ci[mid-1]>=ind:
			#print 'first half'
			upper=mid-1
		else:
			#print 'second half'
			lower=mid+1
	return lower

n=input()
ci=map(int,raw_input().split())
q=input()
for i in range(1,n):
	ci[i]=ci[i]+ci[i-1]
for i in range(q):
	ind=input()
	print bin(ci,ind,0,n-1)+1