#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#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>

//#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
//#endif

#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 <system_error>
//#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>


using namespace std;

int main ()
{
	int N;
	cin >> N;
	vector<int>data ( N + 1 , INT_MAX );
	queue<int>que;
	que.push ( 1 );
	data[1] = 1;
	for( size_t i = 0; i < 10 * N; i++ )
	{
		if( data[N] != INT_MAX )
		{
			cout << data[N] << endl;
			return 0;
		}
		if( que.empty () )
		{
			cout << -1 << endl;
			return 0;
		}
		int now = que.front (); que.pop ();
		int count = 0;
		int now2 = now;
		while( now2 > 0 )
		{
			count += now2 & 1;
			now2 >>= 1;
		}
		if( now + count < N + 1 )
		{
			if( data[now + count] > data[now] + 1 )
			{
				data[now + count] = data[now] + 1;

				que.push ( now + count );
			}
		}
		if( now - count > 0 )
		{
			if( data[now - count] > data[now] + 1 )
			{
				data[now - count] = data[now] + 1;
				que.push ( now - count );
			}
		}
	}

	cout << -1 << endl;
	return 0;
}