Pepcoder And Bits
easy
1. Pepcoder is feeling confident after solving many problems on Bit Manipulation. 2. So, his teacher ask him to find out the count of positive integers strictly less than N, having same number of set bits as that of N. 3. Let us see that if pepcoder can solve it or not.
Constraints
1 <= N <= 10^12
Format
Input
A number N
Output
Check the sample ouput and question video.
Example
Sample Input
1024
Sample Output
10
Question Video