from collections import deque 

N=int(input())

b=[-1,1]+[-1]*N
c=[1]

def getbit(n):
    return int(bin(n).count('1'))

count=0


while c:
    count+=1
    if count>500000:
        print('over')
        break
    d=c.pop(0)
    p=d+getbit(d)
    q=d-getbit(d)
    if d==N:
        break
    if (0<p<=N) and (b[p]==-1):
        c.append(p)
        b[p]=b[d]+1
    if (0<q<=N) and (b[q]==-1):
        c.append(q)
        b[q]=b[d]+1

print(b[N])