For any positive integer $x$, let $g(x)$ denote the number of divisors of $x$. For example, $g(1)=1$ and $g(6)=4$.

If a positive integer $x$ satisfies $g(x) > g(i)$ for all $0 < i < x$, then $x$ is called a highly composite number. For example, the integers $1, 2, 4, 6$ are all highly composite numbers.

Given an integer $N$, can you find the largest highly composite number not exceeding $N$?

Input

The input consists of a single line containing an integer $N$ ($1 \le N \le 2,000,000,000$).

Output

Output a single line containing the largest highly composite number not exceeding $N$.

Examples

Input 1

1000

Output 1

840