// Description
Count the number of 1-bits in the binary representation of n.
// Input
A single integer n (0 <= n <= 10^18).
// Output
The number of set bits (the population count) of n.
// Hint
Repeatedly clear the lowest set bit, or use a popcount builtin.