#include <bits/stdc++.h>
using namespace std;
int main() {
  int arr[100000], n, m, q;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 1; i < n; i++) arr[i] += arr[i - 1];
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> q;
    int low = lower_bound(arr, arr + n, q) - arr;
    cout << low + 1 << endl;
  }
  return 0;
}
