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

const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<'\n'


int main(){
    int n;
    cin >> n;
    int count = 1,t=1;
    set<int>set1;
    set1.insert(t);
    while(t!=n&&set1.size()==count){
        int num = __builtin_popcount(t);
        count++;
        if(t+num>n)t-=num;
        else t+=num;
        set1.insert(t);
    }
    if(set1.size()!=count)COUT(-1);
    else COUT(count);
    return 0;
}