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<iostream> 

using namespace std;

int prime(int arr[], int num) {
    int count = 0;
    bool isPrime = true;
    for(int i = 0; i < num; i++) {
        if(arr[i] <= 2)
           count++;
        else if(arr[i] % 2 != 0) {
            for(int j = 3; j < arr[i] / 2 && isPrime; j += 2) {
                if(arr[i] % j == 0) {
                    isPrime = false;
                }
            }
            if(isPrime)
                count++;
            isPrime = true;
        }
    }
    return count;
}

int main(){ 
    int num, *arr;
    cin >> num;
    arr = new int[num];
    for(int i = 0; i < num; i++) {
        cin >> arr[i];
    }

    cout << prime(arr, num) << endl;
    return 0; 
}