def solve():
    N = int(input())
#     N = s
    is_visited = [False for i in range(N+1)]
    is_visited[1] = True
    is_reached = False
    count = 0

    que = [1]
    while len(que) > 0:
        count += 1
        v_i = que.pop(0)
#         print(v_i, v_i == N, count)
        if v_i == N:
            is_reached = True
            break
        else:
            step = bin(v_i).count("1")
            if v_i+step <= N and not(is_visited[v_i+step]):
                is_visited[v_i+step] = True
                que.append(v_i+step)
            elif v_i-step >= 1 and not(is_visited[v_i-step]):
                is_visited[v_i-step] = True
                que.append(v_i-step)

    if is_reached: return count
    else:          return -1
print(solve())