Worms

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem Statement

There are $n$ ordered piles of worms. Pile $i$ contains $a_i$ worms. All worms are labeled consecutively across the piles, starting from label $1$.

For each queried label $q_j$, determine which pile contains that worm.

Input

The first line contains $n$.

The second line contains $a_1,a_2,\ldots,a_n$.

The third line contains $m$.

The fourth line contains $q_1,q_2,\ldots,q_m$.

Output

For each query, print the 1-based pile number containing the queried label.

Subtasks

• Subtask 1 — 20%: $1\le n,m\le100$.
• Subtask 2 — 30%: $1\le n,m\le5000$.
• Subtask 3 — 50%: $1\le n,m\le10^5$, $1\le a_i\le10^3$, $\sum a_i\le10^6$, $1\le q_j\le\sum a_i$.

Examples

Input

5
2 7 3 4 9
3
1 25 11

Output

1
5
3

Explanation

The pile-ending prefix sums are $[2,9,12,16,25]$. Label $11$ is greater than $9$ and at most $12$, so it belongs to pile $3$.