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

#include <stdio.h>

int PRIMES[100000000] = {0};

void make_prime() {
	PRIMES[0] = 2;
	int i, j;
	
	for (i = 3; i < 10000; ++i) {
		for (j = 0; PRIMES[j] != 0; ++j) {
			if ((i % PRIMES[j]) == 0) {
				break;
			}
		}
		if (PRIMES[j]) {
			continue;
		} else {
			PRIMES[j] = i;
		}
	}
	return;
}

int main(void)
{
	int i, j, n, cnt, p;
	int tmp[10001] = {0};
	make_prime();
	scanf("%d", &n);
	cnt = 0;
	for (i = 0; i < n; ++i) {
		scanf(" %d", &p);
		tmp[i] = p;
	}

	for (i = 0; i < n; ++i) {
		for (j = 0; PRIMES[j] <= tmp[i]; ++j) {
			if (PRIMES[j] == tmp[i]) {
				++cnt;
				break;
			}
		}
	}
	printf("%d\n", cnt);
	return 0;
}