#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace::std;

vector<int> steps(10001, 0);

void dfs(int N, int n, int step){
    steps[n] = step;
    int bit = 0;
    for(int i = 0;i < 20;i++){
        bit += ((n >> i) & 1);
    }
    if(n-bit >= 1 && (step+1 < steps[n-bit] || !steps[n-bit]))  dfs(N, n-bit, step+1);
    if(n+bit <= N && (step+1 < steps[n+bit] || !steps[n+bit]))  dfs(N, n+bit, step+1);
}

int main(){
    int N;
    cin >> N;
    // dfs(N, 1, 1);
    vector<int> bt(N+1, 0);
    for(int i = 1;i < N+1;i++)  bt[i] = bt[i&(i-1)]+1;
    vector<int> dp(N+1, 0);
    dp[1] = 1;
    queue<int> que;
    que.push(1);
    while(!que.empty()){
        int n = que.front();
        que.pop();
        int bit = bt[n];
        if(n-bit >= 1 && !dp[n-bit])    {
            dp[n-bit] = dp[n]+1;
            que.push(n-bit);
        }
        if(n+bit <= N && !dp[n+bit])    {
            dp[n+bit] = dp[n]+1;
            que.push(n+bit);
        }
    }
    if(!dp[N])  cout << -1 << endl;
    else    cout << dp[N] << endl;
    // for(int i = 0;i < 10;i++){
    //     cout << steps[i] << endl;
    // }
}