Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Worms

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIt is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.

Marmot brought Mole *n* ordered piles of worms such that *i*-th pile contains *a*_{i} worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers 1 to *a*_{1}, worms in second pile are labeled with numbers *a*_{1} + 1 to *a*_{1} + *a*_{2} and so on. See the example for a better understanding.

Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.

Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.

Input

The first line contains a single integer *n* (1 ≤ *n* ≤ 10^{5}), the number of piles.

The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 10^{3}, *a*_{1} + *a*_{2} + ... + *a*_{n} ≤ 10^{6}), where *a*_{i} is the number of worms in the *i*-th pile.

The third line contains single integer *m* (1 ≤ *m* ≤ 10^{5}), the number of juicy worms said by Marmot.

The fourth line contains *m* integers *q*_{1}, *q*_{2}, ..., *q*_{m} (1 ≤ *q*_{i} ≤ *a*_{1} + *a*_{2} + ... + *a*_{n}), the labels of the juicy worms.

Output

Print *m* lines to the standard output. The *i*-th line should contain an integer, representing the number of the pile where the worm labeled with the number *q*_{i} is.

Examples

Input

5

2 7 3 4 9

3

1 25 11

Output

1

5

3

Note

For the sample input:

- The worms with labels from [1, 2] are in the first pile.
- The worms with labels from [3, 9] are in the second pile.
- The worms with labels from [10, 12] are in the third pile.
- The worms with labels from [13, 16] are in the fourth pile.
- The worms with labels from [17, 25] are in the fifth pile.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2017 15:48:31 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|