#include <bits/stdc++.h>
using namespace std;
long long cs[100001], a, q, i, t, s, e, m, mp, f, n;
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a;
    if (i > 0)
      cs[i] = cs[i - 1] + a;
    else
      cs[i] = a;
  }
  cin >> q;
  while (q--) {
    s = 0;
    e = n - 1;
    mp = 0;
    m = 0;
    cin >> t;
    f = 0;
    while (s <= e) {
      mp = m;
      m = (s + e) / 2;
      if (cs[m] == t) {
        cout << m + 1 << endl;
        f++;
        break;
      }
      if (cs[m] < t)
        s = m + 1;
      else
        e = m - 1;
    }
    if (f == 0) {
      if (t <= cs[m])
        cout << m + 1 << endl;
      else
        cout << m + 2 << endl;
    }
  }
  return 0;
}
