2010. Sum of Consecutive Prime Numbers

package hgf;
import java.util.Scanner;//1656
public class NewMain5 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in); 
        int a,b,i,j,n,t,r,k=1;
        int[] p= new int[10001];
       
        int l=0;
        for(a=2;a<10000;a++)
        {
            for(b=a-1;b>1;b--)
            {
                if(a%b!=0)
                    continue;
                else
                    break;
            }
            if(b==1)
            {
                p[l]=a;
                l++;
            }
        }
        while(k>0)
        {
            n=scanner.nextInt();
            if(n!=0)
            {
            int f = 0;
            r= 0;
            p[l] = 10002;
            for( i = 0 ; i<l;i++)
            {
                if(p[i]<=n && p[i+1] > n){
                    f= i;
                    break;
                }
            }
                for( i = f; i >=0; i --)
                {
                    int sum = 0;
                    for(j = i; j >=0; j --)
                    {
                        sum += p[j];
                        if(sum == n) {r++;break;}
                         if(sum > n) break;
                    }
                }
                System.out.println(r);

}
        }
    }
    
}