#include <bits/stdc++.h>
using namespace std;
bool flag[10050];
int counter[10050];
static const int INF = 100000000;
int bitcnt(int now){
    int ans = 0;
    while(now > 0){
        if(now % 2 == 1) ans++;
        now /= 2;
    }
    return ans;
}
int main(void){
	for (int i = 0; i < 10050; ++i) {flag[i]=false;}
	for (int i = 0; i < 10050; ++i) {counter[i]=INF;}
    counter[1] = 1;
    int n; cin >> n;
    queue<int> q;
    q.push(1);
    while(!q.empty()){
        int now = q.front(); q.pop();
        if(flag[now]) continue;
        flag[now] = true;
        int d = bitcnt(now);

        if(1 <= now - d && now - d <= n && flag[now - d] == false){
            counter[now - d] = min(counter[now] + 1, counter[now -d]);
            q.push(now - d);
        }
        if(1 <= now + d && now + d <= n && flag[now + d] == false){
            counter[now + d] = min(counter[now] + 1, counter[now + d]);
            q.push(now + d);
        }
    }
    if(flag[n]) printf("%d\n", counter[n]);
    else printf("-1\n");
}