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

v = [0] * (N + 1)
v[1] = 1

q = deque()
q.append(1)


def bfs():
    while len(q) > 0:
        p = q.popleft()
        if p == N:
            return v[p]
        bit_num = bin(p)
        count_1 = bit_num.count('1')

        p_forward = p + count_1
        p_back = p - count_1

        if p_forward <= N and v[p_forward] == 0:
            q.append(p_forward)
            v[p_forward] = v[p] + 1

        if p_back > 0 and v[p_back] == 0:
            q.append(p_back)
            v[p_back] = v[p] + 1

    return -1


print(bfs())