#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
pair<int, int> a[maxn];
struct node {
  int q, ans, id;
} b[maxn];
int main() {
  int n, m;
  scanf("%d", &n);
  int last = 1;
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    a[i] = {last, last + x - 1};
    last += x;
  }
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d", &b[i].q);
    b[i].id = i;
  }
  sort(b + 1, b + m + 1,
       [](const node& x, const node& y) { return x.q < y.q; });
  int now = 1;
  for (int i = 1; i <= m; i++) {
    while (now <= n && a[now].second < b[i].q) now++;
    b[i].ans = now;
  }
  sort(b + 1, b + m + 1,
       [](const node& x, const node& y) { return x.id < y.id; });
  for (int i = 1; i <= m; i++) printf("%d\n", b[i].ans);
  return 0;
}
