#!/mnt/c/Users/moiki/bash/env/bin/python
# N,M = map(int, input().split())
N = int(input())
dp = [10**9 for _ in range(N+1)]
bcount  = [ bin(i).count("1") for i in range(N+1)]

from collections import deque
stack = deque([1])

dp[1] = 1
# stack = [1]
while stack:
    i = stack.pop()
    # cnt = bin(i).count("1")
    cnt = bcount[i]

    if i == N:
        continue

    step1 = dp[i]+1
    back, forward = i-cnt, i+cnt

    if forward  <= N:
        # if dp[i]+1 < dp[i+cnt] :
        if step1 < dp[forward]:
            stack.append( forward)
            dp[forward] = dp[i]+1

    if 1 <=  back:
        if step1 < dp[back] :
            stack.append(back)
            dp[back] = step1

print(dp[N] if dp[N] != 10**9 else -1)