#include <bits/stdc++.h>
using namespace std;
int *A;
int bin_s(int val, int left, int right) {
  int m = (left + right) / 2;
  if (A[m] >= val) {
    if (A[m - 1] < val)
      return m;
    else
      return bin_s(val, left, m - 1);
  } else
    return bin_s(val, m + 1, right);
}
int main() {
  int n, q, x;
  cin >> n;
  A = new int[n + 1];
  A[0] = 0;
  cin >> A[1];
  for (int i = 2; i <= n; ++i) {
    cin >> A[i];
    A[i] += A[i - 1];
  }
  cin >> q;
  for (int i = 0; i < q; ++i) {
    cin >> x;
    cout << bin_s(x, 1, n) << '\n';
  }
  return 0;
}
