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
 
main(){
  int pnumber[N];/*prime number*/
  int number=0;/*natural number*/
  int i,j;
  int count=0; /*prime number count*/
  int flag;
  /*読み込む整数の個数*/
  scanf("%d",&number);
   
  for(i=0; i<number; i++){
    
    flag = 1;

    scanf("%d",&pnumber[i]);
    if((pnumber[i]==2)){
      count++;
      continue;
    }

    if(pnumber[i]%2 == 0)
      continue;

    for(j=3; j <= sqrt(pnumber[i]); j+=2){
      if(pnumber[i]%j == 0){
	flag = 0;	
	break;
      }
    }
    if(flag==1)
      count++;
  }
  
  printf("%d\n",count);
  return 0;
}