#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  vector<int> vec(n);
  for (int i = 0; i < n; i++) scanf("%d", &vec[i]);
  vector<int> cs(n);
  cs[0] = vec[0];
  for (int i = 1; i < n; i++) cs[i] = cs[i - 1] + vec[i];
  int t;
  scanf("%d", &t);
  int find;
  for (int i = 0; i < t; i++) {
    int num;
    scanf("%d", &num);
    printf("%d\n", (lower_bound(cs.begin(), cs.end(), num) - cs.begin()) + 1);
  }
}
