#include <bits/stdc++.h>
using namespace std;
int n, x, q;
int a[100100];
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> x;
    a[i] = a[i - 1] + x;
  }
  cin >> q;
  while (q--) {
    cin >> x;
    cout << lower_bound(a + 1, a + 1 + n, x) - a << endl;
  }
  return 0;
}
