#include <bits/stdc++.h>
using namespace std;
long long int solve(long long int val);
long long int arr[100005], n;
int main() {
  long long int i, j, m, sum, x, ss = 0, y;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> x;
    ss += x;
    arr[i] = ss;
  }
  cin >> m;
  for (i = 0; i < m; i++) {
    cin >> y;
    long long int result = solve(y);
    cout << result + 1 << endl;
  }
}
long long int solve(long long int val) {
  long long int lo, hi, mi;
  lo = 0;
  hi = n - 1;
  while (lo + 1 < hi) {
    mi = (lo + hi) / 2;
    if (arr[mi] > val) {
      hi = mi;
    } else {
      lo = mi;
    }
  }
  if (arr[hi] == val)
    return hi;
  else if (arr[hi] < val)
    return hi + 1;
  else if (arr[lo] == val)
    return lo;
  else if (arr[lo] < val)
    return lo + 1;
  return 0;
}
