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

#define MAX 10*10*10*10*10*10*10*10

int prime(int);

int main(){
  int A[10000];
  int n, i, j, sosuu=0;

  scanf("%d",&n);
  if(n < 1 || 10000 < n) exit(1);

  for(i=0; i<n; i++){
    scanf("%d",&A[i]);
    if(A[i] < 2 || MAX < A[i]) exit(2);
  }

  for(j=0; j<n; j++){
    if(prime(A[j]) == 1) sosuu++;
  }

  printf("%d\n", sosuu);

  return 0;
}

int prime(int A){
  int i;

  for(i=2; i*i<=A; i++){
    if(A%i == 0) return 0;
  }
  return 1;
}