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 i,j=0,c=0,n,tmp;
		n = sc.nextInt();
		
		for(i=0;i<n;i++){
			tmp = sc.nextInt();
			tmp = (int)Math.sqrt((double)tmp);
			if(tmp<=2) continue;
			for(j=2;j<tmp;j++){
				if(tmp % j == 0) break;
			}
			if(j==tmp) c++;
		}
		System.out.println(c);
	}

}