Prime numbers are the ones which can only be divided by 1 and the number itself. 2, 3, 5, 7, 11, 13 etc. are prime numbers.
In this problem, you will take a number N as input and print the total number of prime numbers that are in the left of N.
In the first line of input, you will take a number T ( 1 ≤ T ≤ 105 ). It indicates the total number of testcases. In the following T lines, you will take a number N ( 1 ≤ N ≤ 10 7 ) as input and print the total number of prime numbers that are in the left of N.
For each test case print the ans of the corresponding N in a newline.
5 1 2 3 4 5
0 0 1 2 2