#include <bits/stdc++.h>
using namespace std;
long long int n, m, a[100001], b[100001], q[100001];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) b[i] = a[i] + b[i - 1];
  cin >> m;
  for (int i = 0; i < m; i++) {
    long long int first = 1, last = n, mid, ans = 0;
    cin >> q[i];
    while (first <= last) {
      mid = (first + last) / 2;
      if (q[i] <= b[mid])
        ans = mid, last = mid - 1;
      else
        first = mid + 1;
    }
    cout << ans << endl;
  }
  return 0;
}
