#include <bits/stdc++.h>
using namespace std;
int n, a[100009], sum[100009];
int bin(int L, int R, int x) {
  while (L < R) {
    int M = (L + R) >> 1;
    if (sum[M] >= x)
      R = M;
    else
      L = M + 1;
  }
  return R;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  int m;
  scanf("%d", &m);
  while (m--) {
    int x;
    scanf("%d", &x);
    int ans = bin(1, n, x);
    printf("%d\n", ans);
  }
  return 0;
}
