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 Prime[100000000];
void Sieve(){
	 int j,k;

    for(k=2; k<100000000; k++){
         Prime[k]=k;
         }// 第 k 要素に、値 k をしまう
	Prime[1] = 0;
    for(k=2; k*k<=100000000; k++)          // k の倍数を篩にかける

        if(Prime[k]>0) for(j=2*k; j<=10000; j+=k) Prime[j]=0;
}

int isPrime(int n){
    return Prime[n];
}

int main(void){
    Sieve();
	int n,i;
     	scanf("%6d",&n);
	for(i=0;i<n;i++){
	 int p,count=0;
	 scanf("%8d",&p);
	if(isPrime(p))
	count++;
	}
   return 0;
}