Change the one

You are given an integer $n$. Using bit operations, replace the rightmost $1$ bit in the binary representation of $n$ with $0$.

Input

One integer $n(1\le n\le 10^8)$.

Output

Print the modified integer.

Examples