I. This is an easy problem
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

As you can see, this is an easy problem.

You are given an integer $$$x$$$, and you only need to output how many "1" in its binary representation.

For example, the integer 5 in binary representation is "101", which has 2 "1", so you should output "2".

Input

Only one integer $$$x$$$, and $$$1\leq x\leq 10^9$$$.

Output

Only one integer, the number of "1" in the binary representation of $$$x$$$.

Examples
Input
5
Output
2
Input
1024
Output
1