N=int(input())
pd=[0]*(N+1)
pd [1]=1
pq=[1]

def g(m,n):
    if 1<m<=N and pd[m]<1:
        pd[m]=pd[n]+1
        pq.append(m)

def f(N):
    while len(pq)>0:
        n=pq.pop(0)
        if n==N:    return pd[n]
        nb=bin(n).count('1')
        g(n+nb,n)
        g(n-nb,n)
    return -1

print(f(N))