11. Черви

import java.util.Scanner;
public class Main {

    private static int binarySearch(int[] list, int num) {
        int left = 0;
        int right = list.length;

        while (left < right) {
            int mid = (left + right) / 2;
            if (list[mid] == num) return mid;
            else if (list[mid] < num) left = mid + 1;
            else right = mid;
        }
        return right;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] list = new int[n];

        int temp = 0;
        for (int i = 0;i < n;i++) {
            list[i] = temp + sc.nextInt();
            temp = list[i];
        }
        int m = sc.nextInt();
        for (int i = 0;i < m;i++) {
            int t = sc.nextInt();
            System.out.println(binarySearch(list, t) + 1);
        }
    }
}