#include <bits/stdc++.h>
const int MAXN = 100 + 10;
const int MAXT = 100000 + 10;
const int INF = 0x7f7f7f7f;
const double pi = acos(-1.0);
const double EPS = 1e-6;
using namespace std;
int n, a[MAXT], l[MAXT], r[MAXT], q;
void init() {
  l[0] = 1;
  r[0] = a[0];
  for (int i = 1; i < n; ++i) {
    l[i] = r[i - 1] + 1;
    r[i] = l[i] + a[i] - 1;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  init();
  scanf("%d", &q);
  int tmp;
  while (q--) {
    scanf("%d", &tmp);
    int lur = lower_bound(r, r + n, tmp) - r;
    printf("%d\n", lur + 1);
  }
  return 0;
}
