#include <bits/stdc++.h>
using namespace std;
long long A[100001], n;
long long search1(long long p) {
  long long lo = 0, hi = n - 1, mid;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    if (mid == 0) {
      if (A[0] >= p) {
        return 1;
      }
      if (A[0] < p) {
        lo = mid + 1;
      }
    } else if (mid == n - 1) {
      if (A[mid - 1] < p) {
        return mid + 1;
      }
      if (A[mid - 1] > p) {
        hi = mid - 1;
      } else if (A[mid - 1] == p) {
        return mid;
      }
    } else if (mid < n - 1 && A[mid] >= p && A[mid - 1] < p) {
      return mid + 1;
    } else if (A[mid] > p && A[mid - 1] >= p) {
      hi = mid - 1;
    } else {
      lo = mid + 1;
    }
  }
}
int main() {
  long long k, m, p, i;
  cin >> n;
  cin >> k;
  A[0] = k;
  for (i = 1; i < n; i++) {
    cin >> k;
    A[i] = A[i - 1] + k;
  }
  cin >> m;
  for (i = 0; i < m; i++) {
    cin >> k;
    cout << search1(k) << endl;
  }
  return 0;
}
