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.io.IOException;
import java.util.Scanner;
class Main{
	public static void main(String[] args)throws NumberFormatException, IOException{
//		System.out.println(" ");
		Scanner scan = new Scanner(System.in);
		int times = scan.nextInt();
		int num[] =new int[times];
		int keisan = 0;
		int sosu = 0;
		boolean tf = true;
		for(int i=0;i<times;i++){
			num[i] = scan.nextInt();
		}
		
		for(int i=0;i<times;i++){
			tf = true;

			if (num[i] % 2 == 0){
				tf = false;
			}
			else{
				for (int ii=3;ii<Math.sqrt(num[i]); ii+=2){
					if(num[i] % ii == 0){
						tf = false;
						break;
					}
				}				
			}
			if (num[i] == 2){
				tf = true;
			}
			if (tf == true){
				sosu += 1;
			}
		
		}
		System.out.println(sosu);
	}
}