package yukicoder;
import java.math.BigInteger;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		new Main().solve();
	}

	void solve() {
		Scanner sc = new Scanner(System.in);
		BigInteger N = new BigInteger(sc.next());
		BigInteger ans = N;
		long count=0;
		while(N.compareTo(BigInteger.ZERO)==1){
			if(N.mod(BigInteger.valueOf(2)).equals(BigInteger.ONE)){
				count++;
			}
			N=N.divide(BigInteger.valueOf(2));
		}
		System.out.println(count);
	}
}