# Multiples

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

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

One integer $n(1≤n≤2_{31}−1)$.

## Output

Print the required number.

## Examples

Input #1

Answer #1

Submissions 1K

Acceptance rate 34%