24389번: 2의 보수 ↗

/*
  [24389: 2의 보수](https://www.acmicpc.net/problem/24389)

  Tier: ??
  Category: 구현
*/
#include <bits/stdc++.h>

#define for1(s,n) for(int i = s; i < n; i++)
#define for1j(s,n) for(int j = s; j < n; j++)
#define foreach(k) for(auto i : k)
#define foreachj(k) for(auto j : k)
#define pb(a) push_back(a)
#define sz(a) a.size()

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector <int> iv1;
typedef vector <vector<int> > iv2;
typedef vector <ll> llv1;
typedef unsigned int uint;
typedef vector <ull> ullv1;
typedef vector <vector <ull> > ullv2;

int main() {
  ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

  unsigned int a, b, ans = 0;

  cin >> a;
  b = -a;

  while (a != 0 || b != 0) {
    if ((a & 1) != (b & 1)) {
      ans += 1;
    }
    a = a >> 1;
    b = b >> 1;
  }

  cout << ans;
}