Cheburashka was given a basket containing $$$n$$$ oranges. He decided to share them with his friend, the crocodile Gena. To divide the oranges, Cheburashka uses the following algorithm:
A number $$$n$$$ is called a Cheburashka's number if $$$n$$$ oranges can be completely divided between the friends using the specified algorithm, and the last orange was taken by Cheburashka for Gena.
Find the $$$k$$$-th smallest Cheburashka's number.
The input consists of a single integer $$$k$$$ ($$$1 \le k \le 10^9$$$) — the index of the desired Cheburashka's number.
Output the $$$k$$$-th Cheburashka's number.
1
2
2
5
3
9
| Name |
|---|


