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: Wrong Answer)

import java.text.ParseException;
import java.util.Scanner;

public class Main {

	public static void main(String[] arges) throws ParseException {
		Scanner sc = new Scanner(System.in);
		String line = sc.nextLine();

		int v1 = Integer.parseInt(line);
		int[] vs = new int[v1];
		for (int i = 0; i < v1; i++) {
			String line2 = sc.nextLine();
			vs[i] = Integer.parseInt(line2);
		}
		int sosuuc = 0;
		for (int i = 0; i < v1; i++) {
			int count = 0;
			if (vs[i] <= 10) {

				for (int j = 2; j <= vs[i] /2; j++) {
					if (vs[i] % j == 0) {
						count++;
						if (count == 1) {
							break;
						}
					}
				}

			} else {
				for (int j = 2; j <= 10; j++) {
					if (vs[i] % j == 0) {
						count++;
						if (count == 1) {
							break;
						}
					}
				}

			}
			if (count == 0||vs[i]==2) {
				sosuuc++;
			}
		}
		System.out.println(sosuuc);
	}
}