#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, piles[100000], q;
  cin >> n;
  cin >> q;
  piles[0] = q;
  for (int i = int(1); i < int(n); i++) {
    cin >> q;
    piles[i] = piles[i - 1] + q;
  }
  cin >> m;
  for (int i = int(0); i < int(m); i++) {
    cin >> q;
    int ans = upper_bound(piles, piles + n, q) - piles;
    if (ans > 0 && piles[ans - 1] == q) ans--;
    ans++;
    cout << ans << endl;
  }
  return 0;
}
