#include <iostream> #include <algorithm> #include <string> #include <vector> #include <cmath> #include <queue> #include <functional> #include <map> using namespace std; int n, p = 1, cnt; int main() { cin >> n; while (p < n) { p *= 2; cnt++; } int s = p - n; for (int i = 0; i < 30; i++) { if ((s / (1 << i)) % 2 == 1) cnt++; } cout << cnt << endl; return 0; }