#include <bits/stdc++.h>
using namespace std;
static int n, m, a, q;
static int partial[100001];
int find_position(int k) {
  int a = 0;
  int b = n - 1;
  while (a < b) {
    if (partial[(a + b + 1) / 2] >= k)
      b = (a + b + 1) / 2 - 1;
    else
      a = (a + b + 1) / 2;
  }
  return a;
}
int main() {
  cin >> n;
  partial[0] = 0;
  for (int i = 0; i < n; i++) {
    cin >> a;
    partial[i + 1] = partial[i] + a;
  }
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> q;
    cout << find_position(q) + 1 << '\n';
  }
  return 0;
}
