#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; #define rep(i,n) for(ll i=0;i<(n);i++) #define pii pair<int,int> #define piii pair<int,pii> #define mp make_pair #define pb push_back #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second const int INF = (INT_MAX/2); const ll LLINF = (LLONG_MAX/2); const double eps = 1e-5; const double PI = M_PI; #define DEB cout<<"!"<<endl #define SHOW(a,b) cout<<(a)<<" "<<(b)<<endl #define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cout<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" ")) #define DIV 1000000007 typedef vector<ll> Array; typedef vector<Array> matrix; int main(){ bool done[10001]; fill_n(done,10001,0); int ans = 0; unsigned int n; cin >> n; queue<unsigned int> q; q.push(INF); q.push(1); while(!q.empty()){ if(q.front() == n){ cout << ans << endl; return 0; }else if(q.front() == INF){ if(q.size() == 1){ cout << -1 << endl; return 0; }else{ q.push(INF);ans++; } }else if(q.front() >0 && q.front() <= n && (!done[q.front()])){ q.push(q.front()+__builtin_popcount(q.front())); q.push(q.front()-__builtin_popcount(q.front())); done[q.front()] = 1; } q.pop(); } cout << -1 << endl; }