from collections import deque


def bfs(g: int) -> int:
    queue = deque()
    queue.appendleft((1, 1))
    done = [-1] * (g + 1)
    done[1] = 0
    ans = -1
    while queue:
        d = queue.pop()
        if d[0] == g:
            return d[1]
        cnt = 0
        for i in range(16):
            if (d[0] >> i) & 1:
                cnt += 1
        for a in [1, -1]:
            x = d[0] + cnt * a
            if 0 < x <= g and done[x] == -1:
                queue.appendleft((x, d[1] + 1))
                done[x] = d[1] + 1
    return -1


n = int(input())
print(bfs(n))