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
number_of_boxes = int(raw_input())
chocolates = map(int, raw_input().split( ))
chocolate_index = [-1]*(len(chocolates)+1)
chocolate_index[0] = 0
for index in range(1, 1+len(chocolates)):
	chocolate_index[index] = chocolate_index[index-1]+chocolates[index-1]
	
query_count = int(raw_input())
for x in range(query_count):
	index = int(raw_input())
	left_chocolate_index = 0
	right_chocolate_index = len(chocolates)
	mid_index = (left_chocolate_index + right_chocolate_index)/2
	prev_mid_index = mid_index
	mid_box_start_index = 1+chocolate_index[mid_index-1]
	mid_box_end_index = chocolate_index[mid_index]
	while not mid_box_start_index <= index <=  mid_box_end_index:
		if index < mid_box_start_index:
			right_chocolate_index = mid_index
		if index > mid_box_end_index:
			left_chocolate_index = mid_index
		mid_index = (left_chocolate_index + right_chocolate_index)/2
		if mid_index == prev_mid_index:
			mid_index = mid_index+1
		mid_box_start_index = 1+chocolate_index[mid_index-1]
		mid_box_end_index = chocolate_index[mid_index]
		prev_mid_index = mid_index
	print mid_index