문제<\/h2>
Star and Marco got themselves into a world where they are being attacked by swarms of numbers! Fortunately, the friends know what to do.<\/p>
Each number is first served with a shot from Marco's binary blaster to expose the number's binary notation. After that, Star performs a power move one or more times: she reverses the binary notation of the number and then subtracts one. When the number becomes zero, it shatters to pieces.<\/p>
The heroes have just entered the fight with a number $n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span>. How many power moves would it take to shatter this number to pieces?<\/p> Reversing works as follows: the first digit of the binary notation exchanges places with the last one, the second with the second-to-last, and so on. If leading zeroes appear in the result, they are discarded.<\/p> 입력<\/h2> The first line contains an integer n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> (1<\/mn>\leq<\/mo>n<\/mi>\leq<\/mo>10<\/mn>9<\/mn><\/msup><\/mrow>1 \le n \le 10^9<\/math><\/span><\/span> 1<\/span> <\/span> \leq<\/span> <\/span><\/span> <\/span> n<\/span> <\/span> \leq<\/span> <\/span><\/span> <\/span> 1<\/span> 0<\/span>$

Fight Against Numbers