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
def findIndex(val,list,min,max):
	if min == max :
		return min
	avg = (min+max)/2
	if val == list[avg]:
		return avg
	if val > list[avg]:
		if val < list[avg+1]:
			return avg+1
		if avg<max:
			return findIndex(val,list,avg+1,max)
		return avg
	else:
		if val > list[avg-1]:
			return avg
		if avg>min:
			return findIndex(val,list,min,avg-1)
		else:
			return avg


if __name__=="__main__":
	n=int(input())
	i=0
	boxes=[0]*n
	boxValues = raw_input()
	boxValuesList = boxValues.split()
	while i<n:
		if i > 0:
			boxes[i] = boxes[i-1]+ int(boxValuesList[i])
		else:
			boxes[i] = int(boxValuesList[i])
		i+=1
	q = int(input())
	i=0
	while i<q:
		c = int(input())
		print findIndex(c,boxes,0,n-1) + 1
		# j = 0
		# while j <= 10:
		# 	if c+j in values:
		# 		print box[values.index(c+j)] + 1
		# 		break
		# 	j+=1
		# while j < n:
		# 	if c<=boxes[j]:
		# 		print j+1
		# 		break
		# 	j+=1
		i+=1