T-Prime（数学规律）

Description
We know that prime numbers are positive integers that have exactly two distinct positive divisors.

Similarly, we’ll call a positive integer t Т-prime, if t has exactly three distinct positive divisors。

You are given an array of n positive integers. For each of them determine whether it is Т-prime or not.

Input
The first line contains a single positive integer, n (1 ≤ n ≤ 10000),showing how many numbers are in the array.

The next line contains n space-separated integers xi (1 ≤ xi ≤ 10^12).

Output
Print one line: The number of T-primes number

Sample Input
Copy sample input to clipboard
3
4 5 6
Sample Output
1
Hint
Please use long long instead of int for any Xi.

The given test has three numbers.

The first number 4 has exactly three divisors — 1, 2 and 4.

The second number 5 has two divisors (1 and 5),

The third number 6