# coding: utf-8
from collections import deque

N = int(input())

def solve():
    count = [0] * (N + 1)
    count[1] = 1
    q = deque()
    q.append(1)
    while q:
        num = q.popleft()
        if num == N:
            return count[num]

        bit1_count = "{:b}".format(num).count("1")
        num_front = num + bit1_count
        num_back = num - bit1_count

        if 0 < num_front <= N and count[num_front] == 0:
            q.append(num_front)
            count[num_front] = count[num] + 1

        if 0 < num_back <= N and count[num_back] == 0:
            q.append(num_back)
            count[num_back] = count[num] + 1

    return -1

print(solve())