#include <bits/stdc++.h>
using namespace std;
int arr[(int)1e5 + 1];
int q[(int)1e5 + 1];
int sol[(int)1e5 + 1];
int main() {
  int n, m;
  cin >> n;
  cin >> arr[0];
  for (int i = 1; i < n; i++) {
    int x;
    cin >> x;
    arr[i] = arr[i - 1] + x;
  }
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> q[i];
  }
  for (int i = 0; i < m; i++) {
    int lo = 0, hi = n - 1, res = -1;
    while (lo <= hi) {
      int md = (hi + lo) >> 1;
      if (arr[md] >= q[i] && q[i] >= arr[md - 1]) {
        hi = md - 1;
        res = md;
      } else if (arr[md] >= q[i])
        hi = md - 1;
      else
        lo = md + 1;
    }
    sol[i] = res + 1;
  }
  for (int i = 0; i < m; i++) {
    cout << sol[i] << endl;
  }
  return 0;
}
