import queue

N = int(input())

def nbit(n):
    b = 0
    while 0 < n:
        b += n & 1
        n >>= 1
    return b

def bfs():
    d = []
    for i in range(N+1):
        d.append(None)

    q = queue.Queue()
    q.put(1)
    d[1] = 1

    while 0 < q.qsize():
        c = q.get()

        if c == N:
            break

        nb = nbit(c)
        bs = [-nb, nb]
        for b in bs:
            n = c + b
            if 1 <= n <= N and d[n] == None:
                q.put(n)
                d[n] = d[c] + 1

    return d[N]

result = bfs()
print(result if result != None else -1)