C. Cheburashka's Number
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

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:

  • Cheburashka takes one orange for himself and one orange for Gena;
  • Cheburashka takes two oranges for himself, and Gena takes one;
  • Cheburashka takes three oranges for himself, and Gena takes one;
  • And so on..

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.

Input

The input consists of a single integer $$$k$$$ ($$$1 \le k \le 10^9$$$) — the index of the desired Cheburashka's number.

Output

Output the $$$k$$$-th Cheburashka's number.

Examples
Input
1
Output
2
Input
2
Output
5
Input
3
Output
9