def count_1bit(num):
    if num == 1:
        return 1
    elif num == 0:
        return 0
    else:
        count = num % 2
        return count + count_1bit(num // 2)


def set_node(node_no):
    next_steps = count_1bit(node_no)
    left_no = node_no - next_steps
    if (left_no > 0) and (left_no not in reg_node):
        reg_node.append(left_no)
    else:
        left_no = 0
    right_no = node_no + next_steps
    if (right_no <= target_node) and (right_no not in reg_node):
        reg_node.append(right_no)
    else:
        right_no = 0
    return [node_no, left_no, right_no]


(NOF_NODE) = int(input().rstrip())

target_node = NOF_NODE      # 目標ノード#
reg_node = []               # 探索済みのノード#一覧
curr_nodes = []

# ルートノード
level = 0
reg_node.append(1)
curr_nodes.append(set_node(1))

in_progress = True
while in_progress:
    if len(curr_nodes) == 0:
        level = -1
        in_progress = False
        continue

    level += 1
    next_nodes = []

    for node in curr_nodes:
        # print('LVL:{}--#:{}, L:{}, R:{}'.format(level, node[0], node[1], node[2]))
        if node[0] == target_node:
            in_progress = False
            break
        if node[1] != 0:
            wnode = set_node(node[1])
            next_nodes.append(wnode)
        if node[2] != 0:
            wnode = set_node(node[2])
            next_nodes.append(wnode)
    curr_nodes = next_nodes.copy()

print(level)