The number n is given. Find a number between 1 and n that has the maximum sum of its divisors (including non-prime divisors, 1, and the number itself). If there are several such numbers, print the minimum of them.

Input: The input to the program is natural n<=2500.