#include <iostream>
#include <cstdio>
#include <queue>

#define mp std::make_pair

typedef std::pair<int,int> P;

int N;

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

    int res = -1, minT[10001];
    std::fill(minT, minT+10001, 1001001001);
    std::queue<P> q;
    q.push(mp(1, 1));
    minT[1] = 1;

    while(!q.empty()){
        P p = q.front(); q.pop();

        if(p.second > minT[p.first]){continue;}
        if(p.first == N){res = p.second; break;}

        int bc = __builtin_popcount(p.first);
        if(p.first + bc <= N && p.second+1 < minT[p.first+bc]){
            minT[p.first+bc] = p.second+1;
            q.push(mp(p.first+bc, p.second+1));
            
        }
        if(1 <= p.first - bc && p.second+1 < minT[p.first-bc]){
            minT[p.first-bc] = p.second+1;
            q.push(mp(p.first-bc, p.second+1));
        }
    }

    if(res == -1){
        puts("-1");
    }else{
        printf("%d\n", res);
    }
}