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 N  10000

void isprime(int);
int count=0;

int main(){
  int i,j,n,key;
  int A[N];

  scanf("%d",&n);

  for( i = 0 ; i < n ; i++){
    scanf("%d",&A[i]);
    
  }
  for(i = 1 ; i < n ; i++){
    key = A[i];
    j = i -1;
    while(j >= 0 && A[j] > key){
      A[j+1] = A[j];
      j--;
    }
    A[j+1] = key;
  }
  isprime(A[0]);
  for(i=1;i<n;i++){
    if(A[i] != A[i-1]){
      isprime(A[i]);
    }
  }
  printf("%d\n",count);
  return 0;
}

void isprime(int x){
  int i,j=0;
  if(x!=1){
    for(i=2;i<= sqrt(x);i++){

      if(x%i==0)j++;

    }
    if(j==0)count++;
  }
  else ;
}