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: Time Limit Exceeded)

import java.util.Scanner;
public class Main{
    public static void main(String[]args){
	int i,j,kazu,csosu=0;
	Scanner sc = new Scanner(System.in);
	    i=sc.nextInt();
	for(j=0;j<i;j++){
	    kazu=sc.nextInt();
	    csosu+=sosu(kazu); 
	}
	System.out.println(csosu);
    }
    static int sosu(int x){//return 0(not) or 1(sosu)
	int c;
	for(c=x/2;c>1;c--){
	    if(x%c==0){
		return 0;
	    }
	}
	return 1;
    }
}