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: Runtime Error)

#include <iostream>
#include <cmath>
using namespace std;

bool pn[10000000];

void Eratosthenes(bool* arr , int n){
	int count=0;
	for(int i = 0; i < n; i++){
		arr[i] = true;
	}
	for(int i = 2; i < (int)sqrt(n); i++){
		if(arr[i]){
			for(int j = 0; i * (j + 2) < n; j++){
				arr[i *(j + 2)] = false;
			}
		}
	}
	return; 
}

int main(){
	int n , num;
	int ans=0;
	Eratosthenes(pn , 10000000);
	cin >> n;
	for(int i=0 ; i<n ; i++){
		cin>> num;
		if(pn[num]){
			ans++;
		}
	}
	cout << ans <<endl;
	return 0;
}