Given a natural number n, print count of numbers from 1 to n that have odd number of divisors. For example, 4 has odd number of divisors (1, 2, 4), but 8 doesn't (1, 2, 4, 8)
The first line of input contains an integer T denoting the number of test cases. The first line of each test case is n.
Count of numbers from 1 to n with odd divisors.
1 <= T <= 100
1 <= N <= 106
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.