Count Set Bits in a Binary Number

Given a positive integer num, determine the number of set bits (1s) present in the binary representation of the given number, commonly referred to as the Hamming weight.

Input

num: number: A positive integer

Examples

Input: num = 8
Output: 1
Explanation: The given number in binary (1000) has a total of one set bit

Input: num = 9
Output: 2
Explanation: The given number in binary (1001) has a total of two set bit

Input: num = 123
Output: 6
Explanation: The given number in binary (1111011) has a total of six set bit

Constraints

1 <= num <= 2^31 - 1

Coding and submission is not supported on mobile devices. Use a wider screen to practice solving this question within the editor.

Count Set Bits in a Binary Number

Given a positive integer num, determine the number of set bits (1s) present in the binary representation of the given number, commonly referred to as the Hamming weight.

Input

num: number: A positive integer

Examples

Input: num = 8
Output: 1
Explanation: The given number in binary (1000) has a total of one set bit

Input: num = 9
Output: 2
Explanation: The given number in binary (1001) has a total of two set bit

Input: num = 123
Output: 6
Explanation: The given number in binary (1111011) has a total of six set bit

Constraints

1 <= num <= 2^31 - 1

Count Set Bits in a Binary Number

Input

Examples

Constraints

Count Set Bits in a Binary Number

Input

Examples

Constraints

Premium solution

You must be signed in to view your submissions

Loading editor

Loading editor

Loading tests

JavaScript Console

Loading tests