#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long

int f(int x){
  int ans=0;
  while(x>0){
    if(x%2==1) ans++;
    x/=2;
  }
  return ans; 
}

signed main(){
  vector<int>cb(10100,-1);  
  int n;
  cin>>n;
  if(n==1){
    cout<<1<<endl;
    return 0;
  }
  int temp=1;
  int cnt=1;  
  cb[temp]=1;
  while(temp<=n){
    if(temp+f(temp)>n){
      cnt++;
      temp-=f(temp);
      if(cb[temp] != -1){
        cout<<-1<<endl;
        return 0;
      }
      else{
        cb[temp]=cnt;
      }
    }
    else{
      cnt++;
      temp+=f(temp);
      cb[temp]=cnt;
    }
    if(temp==n){
      cout<<cnt<<endl;
      return 0;
    }
  }
  cout<<-1<<endl;
  return 0;
}