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>
int hantei(int);
main(){
  int i,j,sum=0;
  int N[10000];
  
  for(i=0;scanf("%d",&N[i])==1;i++);
  for(j=0;j<i;j++)if(hantei(N[j])==0)sum++;
  
  printf("%d\n",sum);
  return 0;
}

int hantei(int n){
  int i;
  if(n==2)return 0;
  if(n<2 || (n%2)==0)return 1;
  i=3;
  while(i<=sqrt(n)){
    if((n%i)==0)return 1;
    i+2;}
   return 0;

}