#include <bits/stdc++.h>
using namespace std;
int n, q;
int p[100005];
int search(int x) {
  int in;
  int l, r, mid;
  l = 1, r = n;
  while (l < r) {
    mid = l + r;
    mid >>= 1;
    if (p[mid] >= x)
      r = mid;
    else
      l = mid + 1;
  }
  return l;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  scanf("%d", &n);
  int a = 0;
  for (auto i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    a += p[i];
    p[i] = a;
  }
  scanf("%d", &q);
  while (q--) {
    int x;
    scanf("%d", &x);
    cout << search(x) << endl;
  }
  return 0;
}
