#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct query {
  int x, id;
} q[N];
int n;
int a[N];
int sum = 0, uk = 0;
int m;
int ans[N];
bool cmp(query A, query B) { return A.x < B.x; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  scanf("%d", &m);
  for (int i = 1; i <= m; ++i) {
    scanf("%d", &q[i].x);
    q[i].id = i;
  }
  sort(q + 1, q + m + 1, &cmp);
  for (int i = 1; i <= m; ++i) {
    while (sum < q[i].x) {
      ++uk;
      sum += a[uk];
    }
    ans[q[i].id] = uk;
  }
  for (int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
  return 0;
}
