#include<bits/stdc++.h>
//#include<atcoder/all>

using namespace std;
//using namespace atcoder;

int main(){
    int N;
    cin>>N;

    int bit[N+1];
    for(int i=0;i<=N;i++){
        int n=i;
        int c=0;
        while(n!=0){
            if(n%2==1) c++;
            n/=2;
        }
        bit[i]=c;
    }

    int dp[N+1];
    for(int i=0;i<=N;i++) dp[i]=INT_MAX;

    queue<int> q;
    q.push(1);
    dp[1]=1;

    while(!q.empty()){
        int n=q.front();
        //cout<<n<<endl;
        q.pop();
        if(n-bit[n]>=1&&dp[n-bit[n]]>dp[n]+1) {
            dp[n-bit[n]]=dp[n]+1;
            q.push(n-bit[n]);
        }
        if(n+bit[n]<=N&&dp[n+bit[n]]>dp[n]+1) {
            dp[n+bit[n]]=dp[n]+1;
            q.push(n+bit[n]);
        }
    }

    if(dp[N]==INT_MAX) cout<<"-1"<<endl;
    else cout<<dp[N]<<endl;
}