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: Time Limit Exceeded)

using System;
using System.Collections.Generic;

class Program
{
	static private List<int> PrimeList;

	static private int Max()
	{
		return PrimeList[PrimeList.Count-1];
	}

	static private bool Prime(int n)
	{
		if(n == 1) return false;
		if(PrimeList.Contains(n)) return true;

		foreach(int p in PrimeList)
		{
			if(p > n/2) break;
			if(n%p == 0) return false;
		}

		bool a = true;
		int max = Max();
		if(max < n/2)
		{
			for(int i=max+2; i<n/2; i+=2)
			{
				bool isprime = true;
				foreach(int p in PrimeList)
				{
					if(i%p == 0)
					{
						isprime = false;
						break;
					}
				}
				if(isprime)
				{
					PrimeList.Add(i);
					if(n%i == 0)
					{
						a = false;
						break;
					}
				}
			}
		}
		return a;
	}

	static void Main() 
	{
		PrimeList = new List<int>();
		PrimeList.Add(2);
		PrimeList.Add(3);
		int num = int.Parse(Console.ReadLine());

		int n = 0;
		for(int i=0; i<num; i++)
		{
			if(Prime(int.Parse(Console.ReadLine()))) n++;
		}
		Console.WriteLine(n.ToString());
	}
}