import sys
from collections import deque

def main():
    n = int(sys.stdin.readline())
    if n == 1:
        print(1)
        return

    visited = [False] * (n + 1)
    queue = deque()
    queue.append((1, 1))
    visited[1] = True

    answer = -1
    found = False

    while queue:
        current, steps = queue.popleft()
        bits = bin(current).count('1')
        for delta in [bits, -bits]:
            next_pos = current + delta
            if next_pos == n:
                answer = steps + 1
                found = True
                break
            if 1 <= next_pos < n and not visited[next_pos]:
                visited[next_pos] = True
                queue.append((next_pos, steps + 1))
        if found:
            break

    print(answer if found else -1)

if __name__ == "__main__":
    main()