282. Maximum number of 1s for long long

I'm a slow walker, but I never walk backwards.

Task Description

Write a program to compute the number of 1's in their binary representation. For example 7 has three 1's since its binary representation is 00000111. 25 also has three ones because its binary representation is 00011001.

Input

A set of positive integers no more than 9223372036854775807, one per line. You must process them until EOF.

Output

The number of 1's in the binary representation of the input integer, one per line.

Sample Input

1
3
5
7
127
2147483647
9223372036854775807

Sample Output

1
2
2
3
7
31
63

Discussion