#include <bits/stdc++.h>
using namespace std;
template <typename T>
using vt = vector<T>;
const int N = 1e5 + 5;
int n, a[N];
int binary_search(int q) {
  int lo = 1, hi = n;
  while (lo < hi) {
    int mid = (lo + hi) / 2;
    if (a[mid] < q)
      lo = mid + 1;
    else if (a[mid] > q)
      hi = mid;
    else
      return mid;
  }
  return lo;
}
void test() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] += a[i - 1];
  }
  int m;
  cin >> m;
  while (m--) {
    int q;
    cin >> q;
    int ans = binary_search(q);
    cout << ans << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  test();
  return 0;
}
