def min_moves(N: int) -> int:
    from collections import deque
    queue = deque([(1, 0)])
    visited = set()
    while queue:
        pos, moves = queue.popleft()
        if pos == N:
            return moves + 1
        visited.add(pos)
        next_moves = bin(pos).count('1')
        if pos + next_moves <= N and pos + next_moves not in visited:
            queue.append((pos + next_moves, moves + 1))
        if pos - next_moves > 0 and pos - next_moves not in visited:
            queue.append((pos - next_moves, moves + 1))
    return -1
print(min_moves(int(input())))