delioci
In the interval from 1 to the given number N, your task is to find the number which has the most divisors. In case there is more than one solution, find the smallest one.
InputFrom the standard input read the number N ( 0 < N < 2^31 ).
Output The standard output should contain two numbers (one in each line). The first line should contain the (smallest) number which has the most divisors, and the second line should contain the number of divisors.
Input:
10Output
6
4Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.