#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define codefor int test;cin>>test;while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class T> istream& operator>>(istream& is, vector<T>& vec) {for(T& x : vec)is >> x;return is;}
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){cin >> head;in(tail...);}
void out(){cout << '\n';}
template<class T>void out(const T& a){cout << a << '\n';}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);}
const int INF = 1 << 30;
const long long INF2 = 1ll << 60;
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    LL(n);
    int m = 1000000;
    vector<int> dp2(m + 1, 1 << 30);
    queue<int> nxt;
    nxt.push(n);
    dp2[n] = 0;
    while(!nxt.empty()){
        int v = nxt.front();
        nxt.pop();
        for(ll i = 1; i * v + 1 <= m; i++){
            ll v2 = i * v + 1;
            if(dp2[v] + 1 >= dp2[v2])continue;
            dp2[v2] = dp2[v] + 1;
            nxt.push(v2);
        }
        if(__builtin_popcountll(v) == 1){
            chmin(dp2[1], dp2[v] + 1);
        }
    }

    map<ll,ll> dp;
    function<ll(ll)> rec = [&](ll v){
        if(v <= m) return (ll)(dp2[v]);
        if(v == n) return 0ll;
        if(dp.find(v) != dp.end()) return dp[v];
        ll v2 = v - 1, res = v - n;
        for(ll i = 2; i * i <= v2; i++){
            if(v2 % i == 0){
                chmin(res, rec(i) + 1);
                chmin(res, rec(v2 / i) + 1);
            }
        }
        return dp[v] = res;
    };

    ll ans = dp2[1];
    for(ll i = 20; i <= 40; i++){
        if((1ll << i) < n) continue;
        map<ll,ll> dp3;
        swap(dp, dp3);
        chmin(ans, rec(1ll << i) + 1);
    }
    cout << ans << '\n';
}