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

#include <stdio.h>

int isPrimeNumber(int target_number);
 
int main ( void ) {
	int target_number = 0;
	int loop = 0;
	int Max_number = 0;
	int number_of_prime_numbers = 0;
	int flag_not_prime_number = 0;
	
	scanf ( "%d", &Max_number );
	for ( loop = 0; loop < Max_number; loop++ ) {
		scanf ( "%d", &target_number );
		flag_not_prime_number = isPrimeNumber(target_number);
		 
		if ( flag_not_prime_number == 0 ) {
			number_of_prime_numbers++;
		}
	}
	printf("%d\n", number_of_prime_numbers);
	return 0;
}

int isPrimeNumber(int target_number)
{
	
	int flag_not_prime_number = 0;
	int divisor = 2;
	
	 
	while ( divisor*divisor <= target_number ) {
		if ( target_number % divisor == 0 ) {
			flag_not_prime_number = 1;
			break;
		}
		divisor++;
	}
	return flag_not_prime_number;
}