#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000009
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 10001

int bit_count(ll n){
    ll ret = n;
    
    ret = ret - (ret >> 1 & 0x55555555);
    ret = (ret & 0x33333333) + (ret >> 2 & 0x33333333);
    ret = ret + (ret >> 4) & 0x0f0f0f0f;
    ret = ret * 0x01010101;
    
    return (int)(ret >> 24);
}

int main(){
    ll n,now=1;
    int ans=0;
    
    scanf("%lld",&n);
    
    while(1){
        now+=bit_count(now);
        ans++;
        
        if(n==now){
            printf("%d\n",ans+1);
            return 0;
        }
        
        if(ans>=(ll)INF) break;
    }
    
    puts("-1");
    
    return 0;
}