from collections import deque

def popcount(x):
    return bin(x).count('1')

def shortest_moves(N):
    # 最短移動数を格納するDPテーブル（未訪問は-1）
    dp = [-1] * (N + 1)
    dp[1] = 1  # 開始のマスも移動にカウントする

    queue = deque([1])

    while queue:
        current = queue.popleft()
        step = popcount(current)

        # 次の候補マス
        for next_pos in [current - step, current + step]:
            if 1 <= next_pos <= N and dp[next_pos] == -1:
                dp[next_pos] = dp[current] + 1
                queue.append(next_pos)
                # print(current, next_pos, queue, list(queue), dp)

    return dp[N]

# 入力受付と実行
if __name__ == "__main__":
    N = int(input())
    print(shortest_moves(N))