#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  long long int m;
  cin >> m;
  long long int q[m];
  for (long long int i = 0; i < m; i++) cin >> q[i];
  vector<pair<long long int, long long int>> vec;
  for (long long int i = 1; i <= n; i++) vec.push_back(make_pair(i, 0));
  vector<long long int> v;
  vec[0].second = a[0];
  for (long long int i = 1; i < n; i++)
    vec[i].second = vec[i - 1].second + a[i];
  for (long long int i = 0; i < m; i++) {
    long long int x = q[i];
    if (x <= vec[0].second) {
      cout << 1 << endl;
      continue;
    }
    long long int f = 1, l = n;
    while (f <= l) {
      long long int mid = (f + l) / 2;
      long long int y = mid - 1;
      if (vec[y].second == x) {
        cout << mid << endl;
        break;
      }
      if (x > vec[y].second)
        f = mid + 1;
      else {
        if (x > vec[y - 1].second) {
          cout << mid << endl;
          break;
        } else
          l = mid - 1;
      }
    }
  }
  return 0;
}
