#include <bits/stdc++.h>
#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
#include<string>
using ll = long long;
using namespace std;

int main(){
    int n, now = 1, ans = 1, min1 = 1e9;
    bool found = false;
    cin >> n;
    set<int> st;
    deque<pair<int, int>> dq;
    if (n != 1) dq.push_back({now, ans});
    else{
        found = true;
        min1 = 1;
    }
    while (!dq.empty()){
        now = dq.front().first;
        ans = dq.front().second;
        dq.pop_front();
        int tmp, cnt = 0;
        if (st.count(now)) continue;
        st.insert(now);
        tmp = now;
        while (tmp){
            if (tmp &1) cnt++;
            tmp >>= 1;
        }
        if (now + cnt == n){
            found = true;
            min1 = min(min1, ++ans);
        }
        if (now - cnt > 1) dq.push_back({now - cnt, ans+1});
        if (now + cnt < n) dq.push_back({now + cnt, ans+1});
    }
    if (found) cout << min1 << endl;
    else cout << -1 << endl;
}