#include <bits/stdc++.h>
using namespace std;
int presum[100005];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int a[n + 1];
  for (int i = 0; i < n; i++) cin >> a[i];
  int su = 0;
  for (int i = 0; i < n; i++) {
    presum[i] = su + a[i];
    su = presum[i];
  }
  int m;
  cin >> m;
  while (m--) {
    int q;
    cin >> q;
    int res = lower_bound(presum, presum + n, q) - presum;
    cout << res + 1 << "\n";
  }
  return 0;
}
