# -*- coding: utf-8 -*-

# ビットすごろく（幅優先探索:breadth first searchの活用）

from collections import deque

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

    while len(node_queue) > 0:
        node = node_queue.popleft()
        if node == N:
            return vertices[node]

        bit1_count = '{:b}'.format(node).count('1')
        forward = node + bit1_count
        backward = node - bit1_count
        if 1<=forward and forward<=N and vertices[forward]==0:
            node_queue.append(forward)
            vertices[forward] = vertices[node] + 1
        if 1<=backward and backward<=N and vertices[backward]==0:
            node_queue.append(backward)
            vertices[backward] = vertices[node] + 1
    
    return -1

N = int(input())
print(bfs(N))