#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const int maxn = 1e5 + 5;

int a[maxn];

int main(){

    int n, m;

    cin >> n;

    for(int i = 1; i <= n; ++i)  scanf("%d", &a[i]);

    for(int i = 2; i <= n; ++i) a[i] += a[i-1];

    cin >> m;

    int x;

    while(m--){

        scanf("%d", &x);

        int t = lower_bound(a, a+n, x) - a;

        printf("%d\n", t);

    }

    return 0;

}