#include<bits/stdc++.h>
using namespace std;

int main(){
  long long a=0,b=0,c=0;
  long long i=1;
  long long ans=9223372036854775807;
  long long N;
  cin >> N;

  while(1){
    if(i >= N)break;
    b++;
    i = i << 1;
    a = N / i;
    c = N % i;
    if(a+b+c < ans){
      ans = a+b+c;
    }
  }
  if(b == 0){
    ans = 1;
  }

  cout << ans << endl;
}
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
#define popcount __builtin_popcount

const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;

ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

int main() {
  ll N; cin >> N;
  ll result = N, b = 0;
  while (true) {
    ll a = N/(1ll<<b), c = N%(1ll<<b);
    // cout << a << " " << b << " " << c << endl;
    result = min(result, a+b+c);
    if (a==0) break;
    b++;
  }
  cout << result << endl;
  return 0;
}