Maximum Factors Problem

You are given an integer $N$. Let $K$ be a divisor of $N$ **of your choice** such that $K > 1$, and let $M = \frac{N}{K}$. You need to find the **smallest** $K$ such that $M$ has as many divisors as possible. **Note**: $U$ is a divisor of $V$ if $V$ is divisible by $U$. ### Input - The first line of the input contains an integer $T$ - the number of test cases. The test cases then follow. - The o