#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solution() {
  int n;
  cin >> n;
  int *a = new int[1000001]{};
  int last = 0;
  for (int i = 1; i <= n; ++i) {
    int w;
    cin >> w;
    int beg = last + 1, end = last + w;
    for (int j = beg; j <= end; ++j) a[j] = i;
    last += w;
  }
  int m;
  cin >> m;
  while (m-- > 0) {
    int q;
    cin >> q;
    cout << a[q] << '\n';
  }
  delete[] a;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  solution();
  return 0;
}
