#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, z = 1;
  cin >> n;
  int a[n];
  int tot[n];
  cin >> a[0];
  tot[0] = a[0];
  for (int i = 1; i < n; i++) {
    cin >> a[i];
    tot[i] = tot[i - 1] + a[i];
  }
  int m;
  cin >> m;
  int q[m];
  for (int i = 0; i < m; i++) {
    cin >> q[i];
  }
  for (int j = 0; j < m; j++) {
    for (int i = 0; i < n; i++) {
      if (q[j] < tot[n / 2] || i >= (n / 2) - 1) {
        if (q[j] <= tot[i]) {
          cout << i + 1 << endl;
          z = 1;
          break;
        }
      } else if (q[j] <= tot[(3 * n) / 4] && z == 1) {
        i = (n / 2) - 1;
        z = 0;
      } else if (q[j] <= tot[(5 * n) / 6] && z == 1) {
        i = ((3 * n) / 4) - 1;
        z = 0;
      } else if (q[j] <= tot[(11 * n) / 12] && z == 1) {
        i = ((5 * n) / 6) - 1;
        z = 0;
      } else if (q[j] <= tot[(35 * n) / 36] && z == 1) {
        i = ((11 * n) / 12) - 1;
        z = 0;
      } else {
        i = (35 * n) / 36;
        z = 0;
      }
    }
  }
  return 0;
}
