BETA

Difficulty Level:

Basic

Total Submissions: 77 Accuracy:

10.39%

Maximum number of unique prime factors
     

Given a number N, find the maximum number of unique prime factors any number can have in range [1, N].

Input:
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.

Output:
For each test case, print the maximum number of unique prime factors of a number.

Constraints:
1<=T<=200
1<=N<=1018

Example:
Input:
2

3
500

Output:
1
4

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Arun Tyagi

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.