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


int main() {
    int n;
    cin>>n;
    vector<vector<int>> dp(n+1, vector<int>(n+1));
    map<int,int> bits;
    for(int i=1; i<=n; i++){
        bitset<32> bs(i);
        bits[i] = bs.count();
    }

    dp[0][1]=1;
    for(int i=0; i<n; i++){
        if(dp[i][n]){
            cout << i+1 << endl;
            return 0;
        }
        for(int j=1; j<=n; j++){
            if(bits[j]<j){
                dp[i+1][j-bits[j]] = 1;
            }
            if(j+bits[j]<=n){
                dp[i+1][j+bits[j]] =1;
            }
        }
    }

    cout << -1 << endl;
    return 0;
}