#include <bits/stdc++.h>
using namespace std;
int cal(int* a, int n, int t) {
  int low = 1, high = n, mid = 0;
  while (low < high) {
    mid = (high + low) / 2;
    if (a[mid] < t) {
      low = mid + 1;
      mid = (high + low) / 2;
      if (low >= high) {
        if (a[mid] <= t)
          return mid;
        else
          return mid - 1;
      }
    } else if (a[mid] > t) {
      high = mid - 1;
      mid = (high + low) / 2;
      if (low >= high) {
        if (a[mid] <= t) {
          return mid;
        } else {
          return mid - 1;
        }
      }
    } else {
      return mid;
    }
  }
}
int main() {
  int n, sum = 0, t;
  cin >> n;
  int a[n + 1];
  a[1] = 1;
  sum = sum + 1;
  for (long long i = 0; i < n - 1; i++) {
    cin >> t;
    sum = sum + t;
    a[i + 2] = sum;
  }
  int lst;
  cin >> lst;
  int m;
  cin >> m;
  for (long long i = 0; i < m; i++) {
    cin >> t;
    cout << cal(a, n, t) << endl;
  }
}
