1210 - Sum of Consecutive Prime Numbers

import java.util.ArrayList;
import java.util.Scanner;

class Another {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        ArrayList<Integer> primes = new ArrayList<>();
        primes.add(2);
        primes.add(3);
        int[] values = new int[10001];
        for (int i=4;i<=10000;i++) {
            if (isPrime(i)) primes.add(i);
        }

        for (int i=0;i<primes.size();i++) {
            int total = 0;
            for (int j=i;j<primes.size();j++) {
                total += primes.get(j);
                if (total > 10000) break;
                values[total]++;
            }

        }
        while (scanner.hasNext()) {
            int num = scanner.nextInt();
            if (num == 0) break;
            System.out.println(values[num]);
        }
    }


    static boolean isPrime(int num) {
        if (num == 1 || num == 2 || num == 3) return true;
        for (int i=2;i<=num/2;i++) {
            if (num%i == 0) return false;
        }
        return true;
    }
}