#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
long long primeNumber(long long x) {
  bool fire = true;
  for(int i = 2; i <= sqrt(x); i++) {
    if(x % i == 0) {
      fire = false;
    }
  }
  return fire;
}
int main() {
  ll N; cin >> N;
  int ans = 0;
  while(N >= 1) {
    if(N % 2 == 1) ans++;
    
    N /= 2;
  }
  cout << ans << endl;
}