#include <bits/stdc++.h>
using namespace std;
const int A = 1e5 + 5;
long long int n, a[A], s[A], q, x, l, r, mid;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    s[i] = (s[i - 1] + x);
  }
  cin >> q;
  for (int i = 1; i <= q; i++) {
    cin >> x;
    l = 1;
    r = n;
    while (l != r - 1) {
      mid = (l + r) / 2;
      if (x <= s[mid]) {
        r = mid;
      } else {
        l = mid;
      }
    }
    if (s[l] < x && s[l + 1] >= x) {
      cout << l + 1 << endl;
    } else {
      while (s[l] >= x) {
        l--;
      }
      cout << l + 1 << endl;
    }
  }
}
