#include <iostream>
#include <sstream>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <array>
#include <list>
#include <map>
#include <bitset>
#include <memory>
#include <algorithm>
#include <utility>

namespace Util
{

std::vector<std::string> Split(const std::string& str, const char delim);
std::string Itos(const int value);
std::string Ftos(const double value);
int Stoi(const std::string& buf);
double Stof(const std::string& buf);
std::vector<int> ConvertInt(const std::vector<std::string>& buffers);
std::vector<double> ConvertDouble(const std::vector<std::string>& buffers);

}// namespace Util


namespace Node
{
enum NodeIndex
{
	Front = 0,
	Back,
	Size,
};
}

struct Element
{
	std::array<int, Node::Size> node = { {-1, -1} };
};

void Search(const std::vector<int>& mass, const std::vector<Element>& root, std::vector<int>& memo)
{
	std::list<int> box;
	box.emplace_back(0);

	for(int step = 1; step <= static_cast<int>(mass.size()); ++step)
	{
		std::list<int> process = std::move(box);

		for(auto& target : process)
		{
			if(memo[target] == -1 || step < memo[target])
			{
				memo[target] = step;
			}

			for(int cur = 0; cur < Node::Size; ++cur)
			{
				if(root[target].node[cur] != -1 && memo[ root[target].node[cur] ] == -1)
				{
					box.emplace_back(root[target].node[cur]);
				}
			}
		}
	}
}

int main()
{
	// 入出力の速度向上
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);

	std::string buf;
	std::vector<std::string> buffers;

	std::vector<int> mass;
	std::vector<Element> root;
	std::vector<int> memo;

	std::getline(std::cin, buf);
	mass.resize(Util::Stoi(buf));
	for(int cur = 0; cur < static_cast<int>(mass.size()); ++cur)
	{
		mass[cur] = std::bitset<32>(cur + 1).count();
	}

	root.resize(mass.size());
	for(int cur = 0; cur < static_cast<int>(root.size()); ++cur)
	{
		if(cur + mass[cur] < static_cast<int>(mass.size()))
		{
			root[cur].node[Node::Front] = cur + mass[cur];
		}

		if(0 <= cur - mass[cur])
		{
			root[cur].node[Node::Back] = cur - mass[cur];
		}
	}

	memo.resize(mass.size(), -1);
	Search(mass, root, memo);
	printf("%d\n", memo.back());

	// printf("mass-----\n");
	// for(int cur = 0; cur < static_cast<int>(mass.size()); ++cur)
	// {
	// 	printf("[%5d]%5d\n", cur, mass[cur]);
	// }

	// printf("root-----\n");
	// for(int cur = 0; cur < static_cast<int>(root.size()); ++cur)
	// {
	// 	printf("[%5d]%5d+ %5d-\n", cur, root[cur].node[Node::Front], root[cur].node[Node::Back]);
	// }

	// printf("memo-----\n");
	// for(int cur = 0; cur < static_cast<int>(memo.size()); ++cur)
	// {
	// 	printf("[%5d]%5d\n", cur, memo[cur]);
	// }


	return 0;
}


namespace Util
{

std::vector<std::string> Split(const std::string& str, const char delim)
{
	std::istringstream iss(str);
	std::vector<std::string> ret;
	std::string tmp;

	while(std::getline(iss, tmp, delim))
	{
		ret.push_back(tmp);
	}

	return ret;
}

std::string Itos(const int value)
{
	std::ostringstream ostream;
	ostream << value;
	return ostream.str();
}

std::string Itof(const double value)
{
	std::ostringstream ostream;
	ostream << value;
	return ostream.str();
}

int Stoi(const std::string& buf)
{
	return std::atoi(buf.c_str());
}

double Stof(const std::string& buf)
{
	return std::atof(buf.c_str());
}

std::vector<int> ConvertInt(const std::vector<std::string>& buffers)
{
	std::vector<int> ret(buffers.size());

	for(int cur = 0; cur < static_cast<int>(ret.size()); ++cur)
	{
		ret[cur] = Stoi(buffers[cur]);
	}

	return ret;
}

std::vector<double> ConvertDouble(const std::vector<std::string>& buffers)
{
	std::vector<double> ret(buffers.size());

	for(int cur = 0; cur < static_cast<int>(ret.size()); ++cur)
	{
		ret[cur] = Stof(buffers[cur]);
	}

	return ret;
}

}// namespace Util