Problem:
Prime Numbers

A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.

Write a program which reads a list of N integers and prints the number of prime numbers in the list.

Input

The first line contains an integer N, the number of elements in the list.

N numbers are given in the following lines.

Output

Print the number of prime numbers in the given list.

Constraints

1 ≤ N ≤ 10000

2 ≤ an element of the list ≤ 108

Sample Input 1

5
2
3
4
5
6

Sample Output 1

3

Sample Input 2

11
7
8
9
10
11
12
13
14
15
16
17

Sample Output 2

4

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		int[] num = new int[n];
		for(int i = 0; i < n; i ++){
			num[i] = sc.nextInt();
		}
		System.out.println(judge(num));
	}
	static int judge(int[] num){
		final int max = 1000000 + 1;
		int cnt = 0;
		boolean isp = false;
		for(int i = 0; i < num.length; i++){
			isp = true;
			if(num[i] == (2|3|5|7)) {
				cnt++; continue;
			}
			for(int j = 2; j < num[i]/2; j++){
				if(num[i] % j == 0) {
					isp = false; break;
				}
			}
			if(isp) cnt++;
		}
		return cnt;
	}
}