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
'''
n= int(raw_input())
# print n
arr = map(int,raw_input().split())
for i in xrange(1,len(arr)):
	arr[i]+=arr[i-1]
# print arr
q = int(raw_input())
# print q
# def binary(i,l,r):
# 	mid = l+(r-l)/2
# 	if mid == 0 and i<=arr[0]:
# 		return 1
# 	elif arr[mid-1] < i and arr[mid] >= i :
# 		return mid+1
# 	elif arr[mid-1]>i:
# 		return binary(i,l,mid-1)
# 	elif arr[mid+1] < i:
# 		l = mid+1
# 		return binary(i,l,r)
		
def binary(ele,l,r):
	while l<r:
		mid = (l+r)/2
		if mid == 0 and i<=arr[0]:
			return 1
		elif i == arr[mid]:
			return mid+1
		elif i>arr[mid] and i<=arr[mid+1]:
			return mid+2
		elif i<arr[mid]:
			r = mid
		else:
			l = mid
while q>0:
	i = int(raw_input())
	# j = 0
	# while arr[j]<i:
	# 	j+=1
	# print j+1
	print binary(i,0,len(arr)-1)
	
	q-=1