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: Time Limit Exceeded)

#include <stdio.h>
#define N 100000
void judgment(int*,int);
int main(){
  int C[N],i,k,judge;
  scanf("%d",&k);
  for(i=0;i<k;i++){
    judge = scanf("%d",&C[i]);
    if(judge==-1)break;
      }
    judgment(C,k);
  return 0;
}
void judgment(int *c,int n){
  int i,j,k,max=0,cnt=0,flag=0;

  for(i=0;i<n;i++){
    if(*(c+i)>max){
      max=*(c+i);
    }
  }
  for(j=2;j<=max;j++){
    for(k=2;k<j;k++){
      if(j%k==0)flag=1;
  }
    if(flag==0)cnt++;
    flag=0;
  
  }
  printf("%d\n",cnt);
}