from collections import deque

N = int(input())

def bfs():
    bit_route = deque([0] * (N + 1))
    bit_route[1] = 1
    que = deque()
    que.append(1)

    while(que):
        x = que.popleft()
        if x == N:
            return bit_route[x]
        
        bit_count = int(bin(x).count('1'))
        a = x + bit_count
        b = x - bit_count
        
        if (0 < a <= N) and (bit_route[a] == 0):
            que.append(a)
            bit_route[a] = bit_route[x] + 1
        if (0 < b <= N) and (bit_route[b] == 0):
            que.append(b)
            bit_route[b] = bit_route[x] + 1
      
    return -1
    
print(bfs())