#include <bits/stdc++.h>
using namespace std;
long st[100005];
long bSearch(long v, long s, long e) {
  long mid;
  while (s <= e) {
    mid = (s + e) / 2;
    if (st[mid] == v)
      return mid;
    else if (st[mid] <= v && st[mid + 1] > v)
      return mid;
    else if (st[mid] > v && st[mid + 1] > v) {
      e = mid - 1;
    } else {
      s = mid + 1;
    }
  }
}
int main() {
  long n, m, a, i;
  ios_base::sync_with_stdio(0);
  while (cin >> n) {
    long cnt = 1;
    st[1] = 1;
    for (i = 2; i <= n + 1; i++) {
      cin >> a;
      st[i] = st[i - 1] + a;
    }
    cin >> m;
    for (i = 1; i <= m; i++) {
      cin >> a;
      cout << bSearch(a, 1, n) << endl;
    }
  }
  return 0;
}
