#include<iostream>
#include<queue>
using namespace std;
struct qdata{
    int n;
    int d;
};
int main(){
    int N,count,i;
    bool flag[10001] = {};
    qdata qd,qd_;
    queue<qdata> q;
    cin >> N;
    qd.n = 1;
    qd.d = 1;
    q.push(qd);
    flag[1] = true;
    while(! q.empty()){
        qd = q.front();
        q.pop();
        if(qd.n == N){
            cout << qd.d << endl;
            return 0;
        }
        count = 0;
        i = 0;
        while(1 << i <= qd.n){
            if(1 << i & qd.n) count++;
            i++;
        }
        if(qd.n + count <= N && flag[qd.n+count] == false){
            flag[qd.n+count] = true;
            qd_.n = qd.n + count;
            qd_.d = qd.d + 1;
            q.push(qd_);
        }
        if(qd.n - count >= 1 && flag[qd.n-count] == false){
            flag[qd.n-count] = true;
            qd_.n = qd.n - count;
            qd_.d = qd.d + 1;
            q.push(qd_);
        }
    }
    cout << -1 << endl;
    return 0;
}