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++14 (judge verdict: Accepted)

#include <iostream>
#include <cmath>

using namespace std;

bool is_prime(int num) {
  double sqrt_num = sqrt(num);

  for(int i = 2; i <= sqrt_num; i++) {
    if(num % i == 0) {
      return false;
    }
  }

  return true;
}

int main() {
  int number_num;

  cin >> number_num;

  int prime_count = 0;
  for(int i = 0; i < number_num; i++) {
    int target;
    cin >> target;
    if(is_prime(target)) {
      prime_count++;
    }
  }

  cout << prime_count << endl;
}