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

package main

import (
	"fmt"
	"math"
)

func main() {
	var counter int
	fmt.Scanf("%d", &counter)
	arr := make([]int, counter, 10000)
	for i := 0; i < counter; i++ {
		fmt.Scanf("%d", &arr[i])
	}
	IsPrime(arr)
}
func IsPrime(arr []int) {
	//var temp int
	n := 0
	var flag int
	for i, v := range arr {
		//temp = arr[i]
		flag = 1
		//if v!=2 && v!=3 {
		rt_v := int(math.Sqrt(float64(arr[i])))
		//fmt.Println(rt_v)
		for j := 2; rt_v >= j; j++ {
			if j > 2 && j%2 == 0 {
				continue
			}
			if v%j == 0 {
				flag = 0
				break
			}
			//fmt.Println(arr[i])
		}
		//fmt.Println("There is out of the loop")
		//}else{
		//	fmt.Println(arr[i])
		//}
		if flag == 1 {
			n++
			//fmt.Println(temp)
		}

	}
	fmt.Println(n)
}