#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  long long location = 1;
  long long a_aux;
  int array[n][2];
  for (int i = 0; i < n; i++) {
    scanf("%d", &a_aux);
    array[i][0] = location;
    array[i][1] = a_aux + location - 1;
    location += a_aux;
  }
  int m, start, end, mid;
  scanf("%d", &m);
  location = 0;
  int nasli = n;
  for (int i = 0; i < m; i++) {
    scanf("%d", &location);
    mid = (nasli / 2);
    start = 0;
    end = nasli - 1;
    while (true) {
      if (location >= array[mid][0] && location <= array[mid][1]) {
        printf("%d\n", mid + 1);
        break;
      } else if (location > array[mid][1]) {
        start = mid;
      } else {
        end = mid;
      }
      if ((start + end) % 2 == 0) {
        mid = (start + end) / 2;
      } else if ((start + end) / 2 == mid) {
        mid = (start + end + 1) / 2;
      } else {
        mid = (start + end - 1) / 2;
      }
    }
  }
}
