#include <bits/stdc++.h>
using namespace std;
const int maxsize = 1e5 + 3, maxint = 0X3f3f3f3f;
double error = 1e-6;
int n, m;
long long arr[maxsize];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    arr[i] = x + arr[i - 1];
  }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    long long y;
    scanf("%lld", &y);
    int index = lower_bound(arr, arr + n + 1, y) - arr;
    printf("%d\n", index);
  }
  return 0;
}
