#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, t, beg, end;
  vector<int> a, b;
  bool d;
  cin >> n;
  cin >> t;
  a.push_back(t);
  for (int i = 0; i < n - 1; i++) {
    cin >> t;
    a.push_back(t + a[i]);
  }
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    d = 0;
    cin >> t;
    beg = 1;
    end = n;
    while (end - beg > -1) {
      if (end - beg == 1) d = 1;
      if (a[ceil((beg + end) / 2) - 1] >= t)
        end = ceil((beg + end) / 2);
      else
        beg = ceil((beg + end) / 2);
      if (d == 1) break;
    }
    b.push_back(ceil((float)(beg + end) / 2));
  }
  for (int i = 0; i < m; i++) cout << b[i] << endl;
  return 0;
}
