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: Accepted)

import java.util.Scanner;
class Main{
    public static void main(String[] args){
	int count=0,i,j,yaku=0,n,m;
	
	Scanner scan = new Scanner(System.in);
	n = scan.nextInt();
	if(1>n || n>10000){System.exit(0);}
	 
	for(i=0;i<n;i++){  
	    m = scan.nextInt();
	    if(2>m || m>100000000){System.exit(0);} 
	    for(j=2;j<=Math.sqrt(m);j++){
		if(m%j==0){
		    yaku++;
		}
	    }
	    if(yaku==0){count++;}
	    yaku=0;
	}
	System.out.println(count);
    }
}