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

int main() {
    int n;
    cin>>n;
    vector<vector<int>> dp(n+1, vector<int>(n+1));
    dp[0][1] = 1;

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

    vector<int> ans(n+1,-1);
    ans[1]=1;

    dp[0][1]=1;
    for(int i=1; i<=n; i++){

        for(int j=1; j<n; j++){
            if(!dp[i-1][j]) continue;

            if(bits[j]<j && ans[j-bits[j]] == -1){
                dp[i][j-bits[j]] = dp[i-1][j] + 1;
                ans[j-bits[j]] = i+1;
            }
            if(j+bits[j]<=n && ans[j+bits[j]] == -1){
                dp[i][j+bits[j]] = dp[i-1][j] + 1;
                ans[j+bits[j]] = i+1;
            }

        }
    }

    cout << ans[n] << endl;
    return 0;
}