Pepcoder And Bits

easy

Bit Manipulation

Question Solve Solutions

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.

Input Format

A number N

Output Format

Check the sample ouput and question video.

Constraints

1 &lt;= N &lt;= 10^12

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

Xor Of Sum Of All Pairs

Related Questions

easy Gray Code easy Basics Of Bit Manipulation easy Print Value Of Rsb Mask easy Kernighans Algorithm easy All Repeating Except One easy All Repeating Except Two easy All Repeating Three Times Except One easy One Repeating And One Missing easy Flip Bits To Convert A To B easy Copy Set Bits In A Range easy Check Divisibility By 3 easy Print Binary And Reverse Bits easy Count Set Bits In First N Natural Numbers easy Is A Power Of 2 easy Solve 7n By 8 easy Swap All Odd And Even Bits