from collections import deque

# N = int(input())
# TODO: time to limit
N = 2343
queue = deque([{"count":1, "position":1}])
passed_position = {1}
result = -1

while queue:
    q = queue.popleft()
    print(q)
    current_position = q["position"]
    current_count = q["count"]

    if current_position == N:
        result = current_count
        break

    if current_position < N:
        steps = bin(current_position).count("1")

        forward_position = current_position + steps
        backward_position = current_position - steps

        if forward_position not in passed_position and 1 < forward_position <= N:
            passed_position.add(forward_position)
            queue.append({"count":current_count+1, "position":forward_position})
        if backward_position not in passed_position and 1 < backward_position <= N:
            passed_position.add(backward_position)
            queue.append({"count":current_count+1, "position":backward_position})

print(result)