#include <bits/stdc++.h>
using namespace std;
inline int nxt() {
  int a;
  scanf("%d", &a);
  return a;
}
inline long long int NXT() {
  long long int a;
  scanf("%lld", &a);
  return a;
}
int ara[100010];
int binarysearch(int s, int n) {
  int high = n;
  int low = 1;
  int ans = 1;
  while (low <= high) {
    int mid = (high + low) / 2;
    if (ara[mid] == s) {
      return mid;
    } else if (ara[mid] > s) {
      ans = mid;
      high = mid - 1;
    } else
      low = mid + 1;
  }
  return ans;
}
int main() {
  int n = nxt();
  for (int i = 1; i <= n; i++) ara[i] = ara[i - 1] + nxt();
  int m = nxt();
  for (int i = 0; i < m; i++) {
    int x = nxt();
    int ans = binarysearch(x, n);
    printf("%d\n", ans);
  }
  return 0;
}
