#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 1;
int n, x, q;
int a[M];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    a[i] += x + a[i - 1];
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &x);
    printf("%d\n", lower_bound(a, a + n, x) - a);
  }
}
