#!/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)]

dp[1] = 1
stack = [1]
while stack:
# for i in range(1,N+1):
    i = stack.pop()
    cnt = bin(i).count("1")
    if 1 <= i+cnt  <= N:
        if dp[i]+1 < dp[i+cnt] :
            stack.append( i+cnt )
            dp[i+cnt] = dp[i]+1
    if 1 <= i-cnt  <= N:
        if dp[i]+1 < dp[i-cnt] :
            stack.append( i-cnt )
            dp[i-cnt] = dp[i]+1
        # dp[i-cnt] = min(dp[i-cnt], dp[i]+1)

    # for j in range(1, cnt+1):
    #     try:
    #         dp[i+j] = min(dp[i+j], dp[i]+1)
    #     except IndexError:
    #         continue
    # 
print(dp[N] if dp[N] != 10**9 else -1)
# print(dp)