#include <bits/stdc++.h>
using namespace std;
int bi_search(int a[], int n, int x) {
  int fst = 0, lst = n - 1, mid;
  while (fst <= lst) {
    mid = (fst + lst) / 2;
    if (a[mid] == x) return (mid + 1);
    if (a[mid] > x)
      lst = mid - 1;
    else
      fst = mid + 1;
  }
  return fst + 1;
}
void solve() {
  int n;
  cin >> n;
  int a[n];
  cin >> a[0];
  for (int i = 1; i < n; i++) {
    cin >> a[i];
    a[i] += a[i - 1];
  }
  int q;
  cin >> q;
  int b[q];
  for (int i = 0; i < q; i++) cin >> b[i];
  for (int i = 0; i < q; i++) {
    int r = b[i];
    int ans = bi_search(a, n, r);
    cout << ans << endl;
  }
}
int main() {
  int t = 1;
  while (t--) solve();
  return 0;
}
