#abc215b. [abc215_b]log2(N)
[abc215_b]log2(N)
Problem Statement
Given a positive integer , find the maximum integer such that .
Constraints
- is an integer satisfying .
Input
Input is given from Standard Input in the following format:
Output
Print the answer as an integer.
Sample Input 1
6
Sample Output 1
2
- satisfies .
- For every integer such that , holds.
Therefore, the answer is .
Sample Input 2
1
Sample Output 2
0
Note that .
Sample Input 3
1000000000000000000
Sample Output 3
59
The input value may not fit into a -bit integer.