from collections import defaultdict, deque

def bfs(start):
    distance = [None] + [-1] * N
    distance[start] = 1
    queue = deque([])
    queue.append(start)
    
    while len(queue) > 0:
        current_node = queue.popleft()
        for next_node in adj_dict[current_node]:
            if distance[next_node] == -1:
                distance[next_node] = distance[current_node] + 1
                queue.append(next_node)
    
    return distance
    
N = int(input())
adj_dict = defaultdict(list)

for i in range(1, N):
    tmp = i
    step = 0
    while tmp != 0:
        step += tmp % 2
        tmp = tmp // 2
    if 1 <= i-step:
        adj_dict[i].append(i-step)
    if i+step <= N:
        adj_dict[i].append(i+step)

distance = bfs(1)
print(distance[N])