Problem Description

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.

Input

The input consists of multiple test cases.
For each case, the input contains a single line with one integer P(1 <= P <= 10⁸⁰)

Output

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 2⁶².

100
10
1000000000000000

60 12
6 4
866421317361600 26880