Give you a lot of positive integers, just to find out how many prime numbers there are.
输入解释
There are a lot of cases. In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32-bit signed integer, and each of them won’t be less than 2.
输出解释
For each case, print the number of prime numbers you have found out.