#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> pref(n+1);
    pref[0] = 0;

    int x;
    for(int i = 0; i < n; i++) {
        cin >> x;
        pref[i+1] = pref[i] + x;
    }

    for(int i = 0; i < n; i++) {
        cin >> x;
        auto it = lower_bound(begin(pref), end(pref), x);
        if(it == end(pref)) cout << "-1" << endl;
        else cout << distance(begin(pref), it) << endl;
    }
}