#include <bits/stdc++.h>
using namespace std;
int special_binary_search(int ara[], int number, int n) {
  if (number <= ara[0]) return 0;
  int st = 0, fn = n - 1, i, middle;
  while (fn - st > 1) {
    middle = (st + fn) / 2;
    if (ara[middle] >= number)
      fn = middle;
    else
      st = middle;
  }
  return fn;
}
int main() {
  int n;
  cin >> n;
  int arr1[n];
  for (int i = 0; i < n; i++) cin >> arr1[i];
  for (int i = 1; i < n; i++) arr1[i] = arr1[i - 1] + arr1[i];
  int m;
  cin >> m;
  int arr2[m];
  for (int i = 0; i < m; i++) {
    cin >> arr2[i];
    cout << special_binary_search(arr1, arr2[i], n) + 1 << endl;
  }
  return 0;
}
