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<stdio.h>
#include<math.h>
#define MAX 10000000
int main()
{
	int i, j,n,s,ary[10000],y;
	bool a[MAX];
        double x;

	for (i = 0; i < MAX; i++) {
		a[i] = i >= 2 ? 1:0;
	}
        x=sqrt((double)MAX);
        y=(int)x;
	for (i = 1; i < y; i++) {
		if (a[i]) {
			for (j = 0; i*(j + 2) < MAX; j++) {
				a[i*(j + 2)] = 0;
			}
		}
	}


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