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>
#define N_MAX 10000
#define S_MAX 100000000

int main(){
  int i,j=0,c=0,n,A[N_MAX],flag;
  scanf("%d",&n);
  if(n>N_MAX || n<=0)exit(8);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
    if(A[i]>S_MAX || A[i]<2)exit(0);
  }
  
  for(j=0;j<n;j++){
    flag=0;
    if(A[j]%2==0 && A[j]!=2)flag=1;
    else{
      for(i=3;i<A[j];i+=2){
	if(A[j]%i==0){
	  flag=1;
	  break;
	}
      }
    }
    if(flag==0)c++;
  }
  printf("%d\n",c);
  return 0;
}