#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int bitcnt(long long n) {
  int res = 0;
  while (n > 0) {
    res++;
    n &= n - 1;
  }
  return res;
}

int main() {
  long long n;
  cin >> n;

  int ans = 1e9;
  for (int i = 0; i <= 18; i++) {
    if (1LL << i >= n) {
      ans = min(ans, i + bitcnt((1LL << i) - n));
    }
  }
  cout << ans << endl;
}