Given a number N, find the maximum number of unique prime factors any number can have in range [1, N]. The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a number N as input. For each test case, print the maximum number of unique prime factors of a number. 1 <= T <= 2001 <= N <= 1018If 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.