You are given an integer P, please find an integer K that has the maximum number of divisors under the condition that K <= P. Note that if multiple integers have the same number of divisors, please choose the smallest one.
输入解释
The input consists of multiple test cases. For each case, the input contains a single line with one integer P(1 <= P <= 1080)
输出解释
For each test case, output K and the number of K's divisors. The number of K's divisors is guaranteed to be smaller than 262.