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

#include <stdio.h>
#include <math.h>

#define NMax 10000
#define NMin 1
#define Max pow(10,8)
#define Min 2

int getprime_num(int);

int main(){
  int i,n,Num[NMax],cnt=0;

  scanf("%d",&n);

  if(n>=NMin && n<=NMax)
    for(i=0; i<n; i++){
      scanf("%d",&Num[i]);
      if(Num[i]>=Min && Num[i]<=Max)
        cnt += getprime_num(Num[i]);
    }

  printf("%d\n",cnt);

  return 0;
}

int getprime_num(int a){
  int i;

  if(a == 1) return 0;

  for(i=2; i<a; i++){
    if(a%i == 0)
      return 0;
  }

  return 1;
}