Nathan is a shrewd interplanetary gambler who spends his life deceiving extraterrestrials. On one of his expeditions to Uranus, our space duelist challenged an alien by saying he could beat him in any game of his choosing, imagining that his tricks would guarantee victory. Then, the alien proposed an intense intellectual battle.
Upon learning the rules of the battle, Nathan finds himself in a predicament and ends up asking for your help. Pay close attention, because the rule is somewhat complex: in the first round, the Uranian will say an integer $$$n$$$. In the second and final round, it will be Nathan's turn to say an integer $$$m$$$. The winner is the one who says the larger number.
After knowing the number $$$n$$$ said by the alien, your task is to determine which number $$$m$$$ will guarantee victory for Nathan.
The input consists of a single line containing an integer number $$$n$$$ ($$$1 \le n \le 100$$$) — the number chosen by the alien.
The output must contain a single integer number $$$m$$$ ($$$0 \le m \le 10^5$$$) — a winning answer for Nathan.
12
124