#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long binSrc(long long arr[], long long n, long long item) {
  long long mid, lo, hi;
  lo = 0;
  hi = n - 1;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    if (arr[mid] == item) return mid + 1;
    if (item < arr[mid]) {
      if (!mid) return 1;
      if (arr[mid - 1] < item) return mid + 1;
    }
    if (arr[mid] < item) {
      lo = mid + 1;
    } else
      hi = mid - 1;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  long long arr[n];
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  long long cumSum[n], sz = n;
  cumSum[0] = arr[0];
  for (long long i = 1; i < n; i++) {
    cumSum[i] = cumSum[i - 1] + arr[i];
  }
  long long m;
  cin >> m;
  while (m--) {
    long long num;
    cin >> num;
    cout << binSrc(cumSum, n, num) << "\n";
  }
  return 0;
}
