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 <limits.h>

#define MAX_NUM 10000   //与えられる整数の個数の最大値
#define MAX_PRIME 10e8  //与えられる整数の最大値

int main(void) {
  int n;            //与えられる整数の個数
  long num[MAX_NUM]; //与えられた整数を格納
  int cnt;      //素数の個数
  int i, j, k;

  scanf("%d", &n);
  if(!(1 <= n && n <= MAX_NUM))
    return 0;
  cnt = n;

  for (i = 0; i < n; i++){
    scanf("%ld", &num[i]);
    if(!(2 <= num[i] && num[i] <= MAX_PRIME))
      return 0;
  }

  for (i = 0; i < n; i++) {
    for (j = 2; j * j <= num[i]; j ++) {
      if(num[i] % j == 0) {
        //printf("%d,%d\n", i, j);
        cnt--;
        break;
      }
    }

  }

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