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>
#define Max 10000

int sosuu(int);

int main(){
  int a,n,sum=0;
  int judge;
  int x[Max];

  scanf("%d",&n);

  for(a=0 ; a<n ; a++){
     scanf("%d",&x[a]);
  }

  for(a=0 ; a<n ; a++){
    judge = sosuu(x[a]);
    if(judge == 0)sum++;
  }
  printf("%d\n",sum);

  return 0;
}

int sosuu(int x){
  int m;
  int n;
  n = sqrt(x);
  
  if(x < 2)return -1;
  if(x == 2)return 0;
  if(x % 2 == 0)return -1;
  for(m=3 ; m<=n ; m+=2){
    if(x % m == 0) {
      return -1;
      break;
    }
  }
  return 0;
}