#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
using namespace std;
//1の数をカウント
int count1(int x) {
    int count = 0;
    while(x) {
        if (x&1)
            count++;
        x>>=1;
    }
    return count;
}

int main(int argc, const char * argv[]) {
    int n;
    cin >> n;
    queue<int> qu;
    queue<int> tmpqu;
    int init = 1;
    int tmp;
    qu.push(init);
    int count = 1;
    bool flag = false;
    bool flag2 = false;
    bool passed[10001];
    for (int i = 0; i < 10001; i++) {
        passed[i] = false;
    }
    if(n == 1){
        flag = true;
    }
    //探索
    while(!flag){
        //深さを更新
        count++;
        //プラスマイナス両方の方向を調べる
        while(!qu.empty()){
            tmp = qu.front();
            qu.pop();
            //プラス
            //到達した場合はフラグを立てる
            if(tmp + count1(tmp) == n){
                flag2 = true;
                flag = true;
            }
            else if (tmp + count1(tmp) > n){
            }
            else{
                if(!passed[tmp + count1(tmp)]){
                    tmpqu.push(tmp + count1(tmp));
                    //cout << (tmp + count1(tmp));
                    //cout << "\n";
                }
            }
            //マイナス
            if(tmp - count1(tmp) == n){
                flag2 = true;
                flag = true;
            }
            else{
                if(tmp - count1(tmp) > 0){
                    if(!passed[tmp - count1(tmp)]){
                        tmpqu.push(tmp - count1(tmp));
                        //cout << (tmp - count1(tmp));
                        //cout << "\n";
                    }
                }
            }
        }
        //既存のしかない場合
        if(tmpqu.empty()){
            if(!flag2){
                count = -1;
            }
            flag = true;
        }
        //まとめてプッシュ
        while(!tmpqu.empty()){
            tmp = tmpqu.front();
            tmpqu.pop();
            passed[tmp] = true;
            qu.push(tmp);
        }
    }
    cout << count;
    cout << "\n";
}