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>
#include <stdlib.h>
#include <math.h>

int isPrime(int num);

int main(void)
{
	int N;
	int i, j;
	scanf("%d", &N);
	int* listOfInput = (int*) malloc(N * sizeof(int));
	int* listOfPrime = (int*) malloc(N * sizeof(int));
	for (i = 0; i < N; i++)
		*(listOfPrime + i) = 0;
	for (i = 0; i < N; i++)
		scanf("%d", listOfInput + i);
	j = 0;
	for (i = 0; i < N; i++)
	{
		if(isPrime(*(listOfInput + i)))
		{
			*(listOfPrime + j) = *(listOfInput + i);
			j++;
		}
	}
	printf("%d\n", j);
}

int isPrime(int num)
{
	int d;
	for (d = 2; d <= sqrt(num); d++)
	{
		if (num % d ==  0)
			return 0;
	}
	return 1;
}