def upd(x,t):
    if 0<x<=N and A[x]==0:
        Q.append(x)
        A[x]=A[t]+1
    
def bfs():
    while Q:
        t=Q.pop(0)
        if t==N:return A[N]
        c=bin(t)[2:].count('1')
        upd(t+c,t)
        upd(t-c,t)
    return -1

N=int(input())
A=[0]*10001
A[1]=1
Q=[1]
print(bfs())