def main():
    ret = solve(int(input()))
    print(ret)


def solve(n: int) -> int:
    impossible = 10 ** 7
    steps = [step(i) for i in range(n + 1)]
    memo = [impossible for _ in range(n + 1)]
    stack = [1]
    memo[1] = 1
    while stack:
        cur = stack.pop()
        back = cur - steps[cur]
        front = cur + steps[cur]
        if back < 1:
            pass
        elif memo[back] > memo[cur] + 1:
            memo[back] = memo[cur] + 1
            stack.append(back)

        if front > n:
            pass
        elif memo[front] > memo[cur] + 1:
            memo[front] = memo[cur] + 1
            stack.append(front)

    if memo[n] == impossible:
        return -1
    else:
        return memo[n]


def step(n):
    count = 0
    while n > 0:
        if n % 2 != 0:
            count += 1
        n //= 2
    return count


if __name__ == '__main__':
    main()