#include <bits/stdc++.h>
using namespace std;
long long binarySearch(int arr[], long long l, long long r, long long x) {
  if (r > l) {
    long long mid = l + (r - l) / 2;
    if (arr[mid] >= x)
      return binarySearch(arr, l, mid, x);
    else
      return binarySearch(arr, mid + 1, r, x);
  } else {
    return r;
  }
}
int main() {
  int n;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int dp[n];
  dp[0] = arr[0];
  for (int i = 1; i < n; i++) {
    dp[i] = arr[i] + dp[i - 1];
  }
  int t;
  cin >> t;
  while (t--) {
    int x;
    cin >> x;
    cout << binarySearch(dp, 0, n - 1, x) + 1 << endl;
  }
}
