import queue

N = int(input())

if N == 1:
    print(1)
    exit()

Q = queue.Queue()
Q.put(1)
already = [False for i in range(N + 1)]
dp = [float('inf') for i in range(N + 1)]
dp[1] = 1


while Q.qsize():
    now = Q.get()
    
    if already[now]:
        continue
    already[now] = True
    
    tmp = 0
    for i in bin(now)[2:]:
        tmp += int(i)
        
    for i in [tmp, -tmp]:
        if i + now > 1 and i + now <= N:
            dp[i + now] = min(1 + dp[now], dp[i + now])
            Q.put(i + now)

print(dp[N] if dp[N] != float('inf') else -1)