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 C_i chocolates are there in i^th the box. Description of index is given below :

Suppose there are A₁, A₂ … A_N chocolates in 1^st, 2^nd… N^th boxes respectively. So, indexing of chocolates in 1^st box will be from 1 to A₁, similarly in 2^nd box indexing will be A₁ + 1 to A₂ … and indexing in N^th box will be from A_N-1 + 1 to A_N.

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 C_i, 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⁵
• 1 ≤ C_i ≤ 10
• 1 ≤ ∑ C_i ≤ 10⁶
• 1 ≤ I ≤ ∑ C_i