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

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner scanner = new Scanner(System.in);
		
		int n = Integer.parseInt(scanner.nextLine());
		
		long num;
		int result = 0;

		for (int i = 0; i < n; i++) {
			num = Long.parseLong(scanner.nextLine());
			
			if (isPrime(num)) {
				result++;
			}
			
		}
		
		
		
		System.out.println(result);
	}
	
	static boolean isPrime(long x) {
		boolean result = true;
		
		if (x == 2) {
			return result;
		}

		for (long j = 2; j <= Math.ceil(Math.sqrt(x)) ; j++) {
			
			if (x % j == 0) {
				result = false;
				
				break;
			}
		}
		
		
		return result;
	}
}