import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
from collections import deque
INF = float("inf")

def getlist():
	return list(map(int, input().split()))

class Graph(object):
	def __init__(self):
		self.graph = defaultdict(list)

	def __len__(self):
		return len(self.graph)

	def add_edge(self, a, b):
		self.graph[a].append(b)

class BFS(object):
	def __init__(self, graph, s, N):
		self.g = graph.graph
		self.Q = deque(); self.Q.append(s)
		self.dist = [INF] * N; self.dist[s] = 0
		while self.Q:
			v = self.Q.popleft()
			for i in self.g[v]:
				if self.dist[i] == INF:
					self.dist[i] = self.dist[v] + 1
					self.Q.append(i)

#処理内容
def main():
	N = int(input())
	G = Graph()
	for i in range(1, N + 1):
		n = i
		cnt = 0
		while True:
			if n % 2 == 1:
				cnt += 1
			n >>= 1
			if n == 0:
				break

		if i - cnt >= 1:
			G.add_edge(i, i - cnt)
		G.add_edge(i, i + cnt)

	BF = BFS(G, 1, N + 100)
	# print(BF.dist)
	ans = BF.dist[N]
	if ans == INF:
		print(-1)
	else:
		print(ans + 1)




if __name__ == '__main__':
	main()