#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, x, temp;
  vector<long long> sum;
  vector<long long> search;
  vector<long long> ans;
  long long cur = 0;
  sum.push_back(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    temp = x + sum[sum.size() - 1];
    sum.push_back(temp);
  }
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> x;
    search.push_back(x);
  }
  for (auto e : search) {
    cout << lower_bound(sum.begin(), sum.end(), e) - sum.begin() << endl;
  }
}
