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

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication30
{
    class Program
    {
        static void Main()
        {
            long A = long.Parse(Console.ReadLine()), S = 0;
            for(long B = 0; B < A; B++)
            {
                long C = long.Parse(Console.ReadLine());
                if (C < 5) { if (C == 4 || C == 1) continue;
                    S++;continue;
                }
                for(long J = 2;; J+=2)
                {
                    if (B % J == 0) break;
                    if ((J + 1) * (J + 1) > C) { S++; break; }
                }
            }
            Console.WriteLine(S);
        }
    }
}