#include <bits/stdc++.h>
int n, m, a[100005], q[100005], d[100005];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  scanf("%d", &m);
  for (int i = 0; i < m; i++) scanf("%d", &q[i]);
  d[0] = 1;
  for (int i = 1; i < n; i++) d[i] += d[i - 1] + a[i - 1];
  d[n] = 10000005;
  for (int i = 0; i <= m; i++) {
    int l = 0;
    int h = n;
    while (l <= h) {
      int m = (l + h) / 2;
      if (q[i] >= d[m] && d[m + 1] > q[i]) {
        printf("%d\n", m + 1);
        break;
      } else if (d[m] < q[i])
        l = m + 1;
      else
        h = m - 1;
    }
  }
  scanf("\n");
  return 0;
}
