#!/mnt/c/Users/moiki/bash/env/bin/python
# N,M = map(int, input().split())
from collections import deque
N = int(input())
inf = float("inf")
# dp = [inf for _ in range(N+1)]
dp = [inf, 1] + [inf]*(N+100)
# bcount  = [ bin(i).count("1") for i in range(N+1)]
bcount = list((bin(i).count("1") for i in range(N+1)))

# dp[1] = 1
stack = deque([(1,1)])
pop, append = stack.pop, stack.append

while stack:

    i,steps = pop()
    if i == N:
        continue

    steps = steps+1
    back, forward = i-bcount[i], i+bcount[i]


    if steps < dp[back] :
            append((back, steps))
            dp[back] = steps

    if forward  <= N and steps < dp[forward]:
        append( (forward, steps))
        dp[forward] = steps


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