eolymp
Problems

Multiples

Multiples

Time limit 1 second
Memory limit 128 MiB

Find the number from 1 to n inclusively such that its factorization into prime factors the number of factors is maximized. If there are several such numbers, choose the maximum of them.

For example, if n = 7, the answer is 6, as the biggest number that has in its factorization two primes 2 and 3.

Input data

One integer n\:(1 \le n \le 2^{31} - 1).

Output data

Print the required number.

Examples

Input example #1
7
Output example #1
6
Source 2018 Azerbaijan School Competition, II Stage, April 8, Problem O