#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, a[N], pre[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    pre[i] = a[i] + pre[i - 1];
  }
  int m;
  cin >> m;
  while (m--) {
    int q;
    cin >> q;
    cout << lower_bound(pre + 1, pre + n + 1, q) - pre << '\n';
  }
}
