#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn], l[maxn], r[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    a[i] = a[i - 1] + x;
    l[i] = a[i - 1] + 1;
    r[i] = a[i];
  }
  r[n + 1] = 1e9;
  l[n + 1] = 1e9;
  int m;
  scanf("%d", &m);
  while (m--) {
    int h;
    scanf("%d", &h);
    int p = lower_bound(l + 1, l + n + 1, h) - l;
    if (l[p] > h) p--;
    printf("%d\n", p);
  }
  return 0;
}
