#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m;
  cin >> n;
  vector<long long> a, q, pp;
  for (long long i = 0; i < n; i++) {
    long long x;
    cin >> x;
    a.push_back(x);
  }
  cin >> m;
  for (long long i = 0; i < m; i++) {
    long long x;
    cin >> x;
    q.push_back(x);
  }
  vector<pair<long long, long long> > b, g;
  b.push_back(pair<long long, long long>(1, a[0]));
  long long s = a[0];
  for (long long i = 1; i < a.size(); i++) {
    long long a1 = s;
    s += a[i];
    b.push_back(pair<long long, long long>(a1 + 1, s));
  }
  long long k = 0;
  for (long long i = 0; i < q.size(); i++) {
    long long fi = 0;
    long long la = b.size() - 1;
    long long mid = (fi + la) / 2;
    while (1) {
      if (q[i] >= b[mid].first && q[i] <= b[mid].second) {
        cout << mid + 1 << endl;
        break;
      } else if (b[mid].first < q[i]) {
        fi = mid + 1;
      } else if (b[mid].first >= q[i]) {
        la = mid - 1;
      }
      mid = (fi + la) / 2;
    }
  }
  return 0;
}
