#include <bits/stdc++.h>
int binary_search(long long int a[], int n, long long int x) {
  int left, right, mid;
  left = 0;
  right = n - 1;
  while (left <= right) {
    mid = (right + left) / 2;
    if (a[mid] == x) return mid;
    if (a[mid] > x)
      right = mid - 1;
    else
      left = mid + 1;
  }
  return left;
}
using namespace std;
int main() {
  int n, m, i = 0;
  cin >> n;
  long long int a[n], s = 0, x;
  while (i != n) {
    cin >> x;
    s += x;
    a[i] = s;
    i++;
  }
  cin >> m;
  while (m--) {
    cin >> x;
    i = binary_search(a, n, x) + 1;
    cout << i << endl;
  }
  return 0;
}
