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 n , i , j, s , c = 0,f = 1;
  scanf("%d",  &n);
  for ( i = 0; i < n ;i++ ){
    scanf("%d", &s);
    f = 1;
    /*
    for ( j = 2 ; j < s; j++){
      if ( s % j  == 0) {f = 0 ;break;}
    }
    if ( f == 1 ){c++;}
    f = 1;
  }
    */

    /*

if x == 2
    return true

  if x < 2 または x が偶数
    return false

  i = 3
  while i <= x の平方根
    if x が i で割り切れる
      return false
    i = i + 2

 return true

    */

    if ( s == 2){  c++; continue;}
    else{
      if ( s < 2 || s%2 == 0){ continue;}
      else{
	j =3;
	while ( j <= sqrt(s)){
	  if ( s%j == 0){ f = 0;break;}
	  j += 2;
	}
	if ( f == 0){ continue;}
	else if ( f == 1){ c++;continue;}
      }
    }
  }
  printf("%d\n", c);
  
  return 0;
  
}