from collections import deque

def count_bits(n):
    return bin(n).count("1")

def bfs_min_moves(N):
    if N == 1:
        return 1

    moves = [float('inf')] * (N + 1)
    moves[1] = 1
    queue = deque([1])

    while queue:
        current = queue.popleft()

        step = count_bits(current)

        if current + step <= N and moves[current + step] == float('inf'):
            moves[current + step] = moves[current] + 1
            queue.append(current + step)

        if current - step >= 1 and moves[current - step] == float('inf'):
            moves[current - step] = moves[current] + 1
            queue.append(current - step)

        if moves[N] != float('inf'):
            return moves[N]

    return -1


def main():
    print(bfs_min_moves(int(input())))


if __name__ == "__main__":
    main()