<Problem>
http://ntucoder.net/Problem/Details/1177#!
Uses Crt;
Var n,i,m:longint;
a,b:array[0..1000000] of longint;
f,fi:array[0..1000000] of longint;
Function Tim (l,r,i:int64):int64;
var mid:longint;
begin
while (l<=r) do begin
mid:=(l+r) div 2;
if (f[mid-1]<i) and (f[mid]>=i) then exit(mid) else
if (f[mid]>i) then r:=mid-1 else l:=mid+1;
end;
end;
Begin
readln(n);
f[0]:=0;
for i:=1 to n do begin
read(a[i]);
f[i]:=f[i-1]+a[i];
end;
readln(m);
for i:=1 to m do begin
read(b[i]);
Fi[i]:=Tim(1,n,b[i]);
end;
for i:=1 to m do write(Fi[i],' ');
readln;
End.