소수찾기 알고리즘

public static void main(String[] args) {
    int count = 0;
    boolean prime;
    int[] a = new int[5];
    Scanner sc = new Scanner(System.in);
    for (int i = 0; i < a.length; i++) {
        a[i] = sc.nextInt();

    }
    boolean primee=true;
    for(int i=0;i<a.length;i++){
        for(int j=2;j<a[i];j++){
            primee=true;
            if(a[i]%j==0){
                primee=false;
                break;
            }

        }
        if(primee){
            count++;
        }
    }
    System.out.println(count);