143165576
 1919020031
 1204252996
 210637432
 724264821
 1741
 619489590
 1199537418
 1075765759
 747976826
 638486017
 58438190
 1285316221
 186925426
 1180540990
 833393692
 1818960378
 2000000000
 0
 1309028227
 514714359
 624205168
 1795248373
 643201595
 1304312649

14 3 3 4 5 2 4 4 2 4 6 4 3 4 5 3 5 4 1 5 3 4 5 5 8
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
long long mod = 1e9 + 7;
const int N = 100005;
int main() {
  int n;
  scanf("%d", &n);
  int ans = 0;
  if (n == 0)
    ans = 1;
  else
    while (n > 0) {
      switch (n % 16) {
        case 0:
        case 6:
        case 9:
        case 10:
        case 13:
          ans++;
          break;
        case 8:
        case 11:
          ans += 2;
          break;
      }
      n /= 16;
    }
  cout << ans << endl;
  return 0;
}
