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.