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, i, j, k, l;

   scanf("%d", &n);

   int a[n];

   for(i = 0; i < n; i++) {
      scanf("%d", &a[i]);
   }


   l = 0;




   for(i = 0; i < n; i++) {
      if (a[i] < 3||a[i] % 2 == 1){
         if (a[i] < 6||a[i] % 5 != 0) {
            if (a[i] < 4||a[i] % 3 != 0) {

   k = 0;

   j = 1;
   do {

      if (a[i] % j == 0){
         k++;
      }
      if (k > 2){
         break;
      }
      j++;

   } while(j < a[i] + 1);


      if (k == 2){
         l++;
      }
      }
      }
      }
   }

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

   return 0;
}