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
int judge(int);

int main(){
  int data[N];
  int num,i=0,cnt=0;

  scanf("%d",&num);

  for(i=0;i<num;i++){
    scanf("%d",&data[i]);
  }

  for(i=0;i<num;i++){
    if(data[i] < 2 || data[i] > 100000000) break;
    if(judge(data[i]) == 1) cnt++;
  }

  printf("%d\n",cnt);
  return 0;
}

int judge(int x)
{

  int num;
  num = sqrt(x);
  while(num != 1){

    if(x % num == 0) return 0;
    num--;
  }
  return 1;
}