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: Accepted)

#include<stdio.h>
#include<math.h>
int main (){
  int number;
  int i;
  int list[10000];
  scanf("%d",&number);
  for(i=0;i<number;i++){
    scanf("%d",&list[i]);
  }
  printf("%d\n",prime(list,number));
  return 0;
}
int prime(int l[],int n){
  double judge[10000];
  int i;
  int j;
  int result=0;
  for(i=0;i<n;i++){
    judge[i]=sqrt(l[i]);
    if(l[i]<2);
    else if(l[i]==2){
      result++;
    }
    else if(l[i]%2==0);
    else{
      result++;
      for(j=3;j<=judge[i];j+=2){
	if(l[i]%j==0){
	  result--;
	  break;
	}
      }
    }
  }
  return result;
}