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 C (judge verdict: Wrong Answer)



#include <stdio.h>


int main(){

	int i, n, k, l, c=0;
	long j, v;
	long w[9] = {2, 3, 5, 7, 11, 13, 17, 19, 23};

	scanf( "%d", &n );


	for( i=0; i<n; i++ ){

		scanf( "%ld", &v );

		
		for( k=0; k<9; k++ ){
			if( v==w[k] ) c++; 
		}
		if( c == 0 ) continue;



		for( j=29l; j<=v; j++ ){

			l = 0;
			for( k=0; k<9; k++ ){
				if( v%w[k] == 0 ) l++;
			}
			if( l != 0 ) break;


			if( v%j == 0 ){
				break;
			}
		}

		if( v == j ) c++;
		


	}


	printf( "%d\n", c );

	return 0;

}