#include <bits/stdc++.h>
using namespace std;
int binary(int st, int en, int s[], int k) {
  while (en >= st) {
    int mid = st + (en - st) / 2;
    if (k < s[0]) {
      return st;
    }
    if (k > s[en]) {
      return en;
    }
    if (k == s[mid]) {
      return mid;
    }
    if (k >= s[mid] && k <= s[mid + 1]) {
      return mid + 1;
    }
    if (s[mid] > k) {
      en = mid;
    } else {
      st = mid;
    }
  }
}
int main() {
  int n, x;
  int sum = 0;
  cin >> n;
  int s[n];
  for (int j = 0; j < n; j++) {
    cin >> x;
    sum = sum + x;
    s[j] = sum;
  }
  int size = sizeof(s) / sizeof(s[0]);
  int m;
  cin >> m;
  while (m--) {
    int k;
    cin >> k;
    int ans = binary(0, size - 1, s, k);
    cout << ans + 1 << endl;
  }
  return 0;
}
