#930. Josephus problem (k=2)
n people stand in a circle (1..n). Counting from 1, every 2-th person leaves. Find the number of the last person left.
### Input
One integer n (1 ≤ n ≤ 1000).
### Output
A number.
Examples
Input
792
Output
561
Input
116
Output
105
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.