{"scoring":null,"notes":"","legend":"Star and Marco got themselves into a world where they are being attacked\r\nby swarms of numbers!\r\nFortunately, the friends know what to do.\r\n\r\nEach number is first served with a shot from Marco's binary blaster\r\nto expose the number's binary notation.\r\nAfter that, Star performs a power move one or more times:\r\nshe reverses the binary notation of the number and then subtracts one.\r\nWhen the number becomes zero, it shatters to pieces.\r\n\r\nThe heroes have just entered the fight with a number $n$.\r\nHow many power moves would it take to shatter this number to pieces?\r\n\r\nReversing works as follows:\r\nthe first digit of the binary notation exchanges places with the last one,\r\nthe second with the second-to-last, and so on.\r\nIf leading zeroes appear in the result, they are discarded.\r\n","authorLogin":"gassa","language":"english","timeLimit":1000,"output":"Print a single integer: how many times would Star have to perform\r\nthe power move so that the number $n$ becomes zero and shatters to pieces.\r\n","inputFile":"stdin","outputFile":"stdout","input":"The first line contains an integer $n$\r\n($1 \\le n \\le 10^9$).\r\n","authorName":"Ivan Kazmenko","sampleTests":[{"output":"1\r\n","input":"4\r\n","inputFile":"example.01","outputFile":"example.01.a"},{"output":"2\r\n","input":"3\r\n","inputFile":"example.02","outputFile":"example.02.a"},{"output":"3\r\n","input":"11\r\n","inputFile":"example.03","outputFile":"example.03.a"}],"name":"Fight Against Numbers","interaction":null,"memoryLimit":1073741824,"tutorial":""}