#include <bits/stdc++.h>
using namespace std;
struct ii {
  int l, r;
  ii() {}
  ii(int l, int r) : l(l), r(r) {}
} v[100100];
int n;
int bb(int val) {
  int l = 0, r = n - 1, mid = 0;
  while (l <= r) {
    mid = (l + r) / 2;
    if (val >= v[mid].l && val <= v[mid].r) break;
    if (val < v[mid].l)
      r = mid;
    else
      l = mid + 1;
  }
  return mid;
}
int main() {
  int val, m;
  scanf("%d", &n);
  int aux = 0, sum = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &val);
    sum += val;
    v[i] = ii(aux + 1, sum);
    aux = sum;
  }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    scanf("%d", &val);
    printf("%d\n", bb(val) + 1);
  }
}
