#include <bits/stdc++.h>
int search(int n, int *b, int p, int q);
int a[100005], b[100005];
int main() {
  int n, sum = 0;
  scanf("%d", &n);
  a[0] = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    a[i] += sum;
    sum = a[i];
  }
  int m;
  scanf("%d", &m);
  for (int j = 0; j < m; j++) scanf("%d", b + j);
  for (int j = 0; j < m; j++) {
    printf("%d", search(b[j], a, 0, n));
    if (j != m - 1) printf("\n");
  }
  return 0;
}
int search(int n, int *a, int p, int q) {
  int b = (p + q) / 2;
  if (n > a[b] && n <= a[b + 1])
    return b + 1;
  else if (n <= a[b])
    return search(n, a, p, b);
  else
    return search(n, a, b + 1, q);
}
