#include<bits//stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long int ll;
typedef long double ld;
const int MAX = 510000;
const ll MOD = 1000000007;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
int main(){
    int n,now=1,cnt=0;cin >>n;
    vector<int> a(n+10,0),dp(n+1,1e9);
    req(i,n){
        a[i] = __builtin_popcount(i);
    }dp[n]=1;
    for(int i = n-1;i>=1;i--){
        if(i+a[i] <= n)chmin(dp[i],dp[i+a[i]]+1);
        if(i-a[i] >=1) chmin(dp[i],dp[i-a[i]]+1);
    }for(int i = n-1;i>=1;i--){
        if(i+a[i] <= n)chmin(dp[i],dp[i+a[i]]+1);
        if(i-a[i] >=1) chmin(dp[i],dp[i-a[i]]+1);
    }
    if(dp[1]==1e9) cout << -1 << endl;
    else cout << dp[1] <<endl;
}