#include <bits/stdc++.h>
using namespace std;
long long n, m, r, j, k = 1, n1, m1, d, l, a[100007], b[100009];
double e;
string s[1004];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i] += a[i - 1];
  }
  cin >> m;
  for (int i = 0; i < m; i++) cin >> b[i];
  for (int i = 0; i < m; i++) {
    int rr = upper_bound(a, a + n, b[i]) - a;
    if (a[rr - 1] == b[i] || a[rr] == 0)
      cout << rr << endl;
    else
      cout << rr + 1 << endl;
  }
  return 0;
}
