#include <bits/stdc++.h>
using namespace std;
int n, p[100002], m, w;
int main() {
  scanf("%d%d", &n, &p[0]);
  for (int i = 1; i < n; i++) {
    scanf("%d", &p[i]);
    p[i] += p[i - 1];
  }
  scanf("%d", &m);
  while (m--) {
    scanf("%d", &w);
    int lo = 0, hi = n - 1, mid;
    while (hi > lo) {
      mid = (hi + lo) / 2;
      if (p[mid] == w) {
        hi = mid;
        break;
      }
      if (p[mid] > w)
        hi = mid;
      else
        lo = mid + 1;
    }
    printf("%d\n", hi + 1);
  }
  return 0;
}
