#include <bits/stdc++.h>
using namespace std;
int num[100007];
int main() {
  vector<pair<int, int> > data;
  int curr = 0;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> num[i];
    data.push_back(make_pair(curr + 1, curr + num[i]));
    curr = curr + num[i];
  }
  int m;
  cin >> m;
  int x;
  for (int i = 0; i < m; i++) {
    cin >> x;
    int s = 0, e = n - 1;
    int ans;
    while (s <= e) {
      int mid = s + (e - s) / 2;
      if (x >= data[mid].first && x <= data[mid].second) {
        ans = mid + 1;
        break;
      } else if (x >= data[mid].first && x >= data[mid].second) {
        s = mid + 1;
      } else
        e = mid - 1;
    }
    cout << ans << endl;
  }
  return 0;
}
