Kernighans Algorithm

easy
Question Solve Solutions 
1. You are given a number n.
2. You have to count the number of set bits in the given number.

Input Format

A number n

Output Format

Number of set bits in n

Constraints

1 <= n <= 10^9

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
58
Output
4
Previous
Print Value Of Rsb Mask
Next
All Repeating Except One

Related Questions

easy Gray Code easy Basics Of Bit Manipulation easy Print Value Of Rsb Mask 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 easy Sum Of Bit Differences Of All Pairs