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;
using System.Linq;
namespace csharptest
{
    class Program
    {
        static void Main(string[] args)
        {
            long n = long.Parse(Console.ReadLine());
            long a;
            long ans = 0;
            for (long m = 0; m < n; m++)
            {
                a = long.Parse(Console.ReadLine());
                if (a > 3)
                {
                    if (IsPrime(a))
                    {
                        ans++;
                    }
                }
                else if (a < 4 && a > 1)
                {
                    ans++;
                }
            }
            Console.WriteLine(ans);
        }
        static bool IsPrime(long n)
        {
            if (n < 2) return false;
            if (n == 2) return true;

            for (long i = 2; i < n; i++)     // ???1
            {
                if (n % i == 0) return false;
            }
            return true;
        }
    }
}