#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> P;

int N;
int step[10001];
bool visited[10001];

int main(){
    scanf("%d", &N);
    for(int x = 1; x <= N; x++){
        int c = 0;
        for(int y = x; y > 0; y /= 2) c += y&1;
        step[x] = c;
    }
    queue<P> que;
    que.push(P(1, 1));
    fill(visited, visited+N+1, false);
    P p;
    while(!que.empty()){
        p = que.front(); que.pop();
        int s = p.first, c = p.second;
        if(visited[s]) continue;
        if(s == N) break;
        visited[s] = true;
        if(s - step[s] >= 1){
            que.push(P(s-step[s], c+1));
        }
        if(s + step[s] <= N){
            que.push(P(s+step[s], c+1));
        }
    }
    if(p.first == N){
        printf("%d\n", p.second);
    }else{
        puts("-1");
    }
    return 0;
}