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(void)
{
	int i; //割る
	int n; //入力された自然数
	int prime[10000];
	int j = 0;
	int counter = 0; //素数の個数

	prime[j++] = 2;
	prime[j++] = 3;

	scanf("%d", &n);

	for (n = 5; n <= 100000; n += 2) {
		for (i = 1; i < j; i++) {
			if (n % prime[i] == 0)
				break;

		}
		if (j == i)
			prime[j++] = n;
	}

	for (i = 0; i < j; i++)
		counter++; 

		printf("%d\n", counter);
	
	return(0);

}