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<stdlib.h>

static const int N = 10000;
static const int MIN = 2;
static const int MAX = 10*10*10*10*10*10*10*10;

int main(){
  int n, i,j,count=0,number,flag;
  int A[N+1];

  scanf("%d", &n);

  if(MIN > n || n > MAX){
    printf("不正な数です。");
    exit(1);
  }

  for ( i = 1; i <= n; i++ ){
    scanf("%d", &A[i]);
    if(1 > A[i] && A[i] > N){
      exit(1);
    }
  }

  for( i = 1; i <= n; i++ ){

    number = A[i];

    flag = 0;

    for( j = 2; j < number; j++){
      if(A[i]%j == 0){
	flag = 1;
      }
    }
    if(flag == 1){
      count++;
    }
  }

  printf("%d\n",n - count);

  return 0;
}