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>


int main(void){

  int N;
  int i;
  int ans=0;
  
  
  scanf("%d",&N);
    int array[N];
 

    
  for(i=0;i<N;i++){
    scanf("%d",&array[i]);
  }
  
  ans=judge(array,N);
  printf("%d\n",ans);
  
  return 0;  
}

int judge(int a[],int N){
  int count=0;
  int count1=0;
  int i;
  int j;



  for(i=0;i<N;i++){
    count=0;

    for(j=2;j<a[i];j++){
      
      
      if(a[i]%j==0){
	count=count+1;
	break;
    }

   }

    if(count==0){count1++;}
  }

  return count1;  
}