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 find_index(_chocolate_sums,_chocolate):
	min,max=0,len(_chocolate_sums)
	while True:
		index=int((min+max)/2)
		if index==0:
			if _chocolate_sums[index]>=_chocolate:
				return index+1
		if _chocolate_sums[index]<_chocolate:
			min,max=index+1,max
			continue
		elif _chocolate_sums[index]>=_chocolate and _chocolate_sums[index-1]<_chocolate:
			return index+1
		else:
			min,max=min,index-1
			continue
			
boxes=int(raw_input())
chocolates=map(int,raw_input().split())
chocolate_sums=[]
for i in range(boxes):
	if i==0:
		chocolate_sums.append(chocolates[i])
	else:
		chocolate_sums.append(chocolate_sums[i-1]+chocolates[i])

tests= int(raw_input())
for test in range(tests):
	chocolate=int(raw_input())
	print find_index(chocolate_sums,chocolate)