Suppose there are A1, A2 … AN chocolates in 1st, 2nd… Nth boxes respectively. So, indexing of chocolates in 1st box will be from 1 to A1, similarly in 2nd box indexing will be A1 + 1 to A2 … and indexing inNth 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 ith 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 ≤ 105
- 1 ≤ Ci ≤ 10
- 1 ≤ ∑ Ci ≤ 106
- 1 ≤ I ≤ ∑ Ci