from collections import deque
N = int(input())

def bfs():
    v = deque([0]*(N+1))
    v[1] = 1
    q = deque()
    q.append(1)
    while (q):
        u = q.popleft()
        if u == N:
            return v[u]
        bit1_count = "{:b}".format(u).count("1")
        v1 = u+bit1_count
        v2 = u - bit1_count
        if (0 < v1 <=N) and (v[v1]==0):
            q.append(v1)
            v[v1]=v[u]+1
        if (0<v2<=N) and(v[v2]==0):
            q.append(v2)
            v[v2] = v[u]+1
            
    return -1
print(bfs())