#include <bits/stdc++.h>
using namespace std;
int buscabin(int x, int v[], int n) {
  int ini = 1, meio, fim = n;
  while (ini <= fim) {
    meio = (ini + fim) / 2;
    if (x <= v[meio] && x > v[meio - 1]) return meio;
    if (v[meio] > x)
      fim = meio - 1;
    else
      ini = meio + 1;
  }
}
int main() {
  int n, m, x, piles[100001], ant = 0, juice;
  scanf("%i", &n);
  piles[0] = 0;
  for (int i = 1; i <= n; ++i) {
    scanf("%i", &x);
    ant += x;
    piles[i] = ant;
  }
  scanf("%i", &m);
  for (int i = 0; i < m; ++i) {
    scanf("%i", &juice);
    printf("%i\n", buscabin(juice, piles, n));
  }
  return 0;
}
