Complement to 0
If we take a number like 5 and represent it as a binary number, we’ll get
101. We can complement it and get 10 (discard the initial 0) which corresponds to 2. Complementing it again will result in 1 (discard the initial 0) which corresponds to 1. And complementing 1 will give us 0. 101 → 10 → 1 → 0.
So, to get from 5 to 0 we had to perform 3 complement operations. It’s pretty tedious to do this by hand, so the company asks you to write a program that would compute the number of complement operations that would turn the initial number
n to 0.Input
The input contains a single integer
n (1 ≤ n ≤ ).Output
The output should contain a single integer - the number of complement operations we need to perform to turn
n into 0.Examples
Input | Output |
5 | 3 |
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB