#include <bits/stdc++.h>
using namespace std;
int binSearch(int a, int* numSet, int setSize) {
  int initial = 0;
  int final = setSize - 1;
  int i = 0;
  while (true) {
    i++;
    if (i == 20) break;
    int mid = initial + (final - initial) / 2;
    if (final - initial <= 1) {
      if (a < numSet[final] && a > numSet[initial])
        return final + 1;
      else if (a <= numSet[initial])
        return initial + 1;
      else
        return final + 1;
    }
    if (numSet[mid] > a) {
      final = mid;
    } else if (numSet[mid] < a) {
      initial = mid;
    } else {
      return mid + 1;
    }
  }
  return 0;
}
int main() {
  int n;
  cin >> n;
  int* cumuArray = new int[n];
  for (int i = 0; i < n; i++) {
    cumuArray[i] = 0;
    int t;
    cin >> t;
    if (i == 0)
      cumuArray[i] = t;
    else
      cumuArray[i] = cumuArray[i - 1] + t;
  }
  int numJuicy = 0;
  cin >> numJuicy;
  for (int i = 0; i < numJuicy; i++) {
    int t;
    cin >> t;
    int pileInd = binSearch(t, cumuArray, n);
    cout << pileInd << endl;
  }
}
