from collections import deque
N=int(input())
p=[0,1]+[0]*N
d=deque([1])
def g(m,n):
    if 1<m<=N and p[m]<1:
        p[m]=p[n]+1
        d.append(m)
def f(N):
    while d:
        n=d.popleft()
        if n==N:    return p[n]
        bn=bin(n).count('1')
        g(n+bn,n)
        g(n-bn,n)
    return -1
print(f(N))