#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  int m;
  cin >> m;
  for (int i = 1; i < n; i++) {
    v[i] += v[i - 1];
  }
  for (int i = 1; i <= m; i++) {
    int target;
    cin >> target;
    int start = 0;
    int end = n - 1;
    while (start <= end) {
      int mid = (start + end) / 2;
      if (v[mid] >= target && target > v[mid - 1] && mid != 0) {
        cout << mid + 1 << endl;
        break;
      } else if (v[mid] >= target && mid == 0) {
        cout << 1 << endl;
        break;
      } else if (v[mid] < target) {
        start = mid + 1;
      } else {
        end = mid - 1;
      }
    }
  }
}
