There is a magical candy box in which it gives some random number of candies every day.But after N days its magical power will be lost. So you can collect  some random number of candies  everyday for N days.

Now you will be  asked Q queries. In each query you have to answer number of days it took  to collect M number of candies.

INPUT :

First line of test case contains N denoting number of days.

Next line there will be N space seperated integers denoting Number of candies you get each day.

Next line contains Q dentoing number of queries and next q lines followed by M .

OUTPUT :

For each of the Q queries, you have to output the number of days taken to collect M number of candies in a new line.

CONSTRAINTS :

$1<=N,Q<=5*10^5$

$1<=a[i]<=10^5$

$1<=M<=sum of candies$