#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

LL bitcount(LL num){
	num = (num &0x5555555555555555) +(num>> 1 & 0x5555555555555555);
	num = (num &0x3333333333333333) +(num>> 2 & 0x3333333333333333);
	num = (num &0x0f0f0f0f0f0f0f0f) +(num>> 4 & 0x0f0f0f0f0f0f0f0f);
	num = (num &0x00ff00ff00ff00ff) +(num>> 8 & 0x00ff00ff00ff00ff);
	num = (num &0x0000ffff0000ffff) +(num>>16 & 0x0000ffff0000ffff);
	num = (num &0x00000000ffffffff) +(num>>32 & 0x00000000ffffffff);
	return num;
	/*int ans = 0;
	while(num){
		if(num%2 == 1)++ans;
		num /= 2;
	}
	return ans;*/
}
int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(16);//
	
	LL N;
	cin>>N;
	LL pos =  1;
	LL ans = 1;
	LL add;
	while(pos < N){
		add = bitcount(pos);
		pos += add;
		++ans;
		if( add == 0 ){
			break;
		}
	}
	if(pos == N){
		P(ans);
	}else{
		P(-1);
	}
	return 0;
}