N = int(input())
iadd = []
inow = [-1] * N
stack = []
for k in range(N):
    a = list(format(k+1,'b'))
    iadd.append(a.count("1"))

i = 0
inow[0] = 1
while i < N-1:
    for j in range(2):
        inx = i + (-1) ** j * iadd[i]
        if inx == N - 1:
            inow[inx] = inow[i] + 1
            stack = [inx]
            break
        elif -1 < inx < N - 1 :
            if inow[inx] == -1:
                stack.append(inx)
                inow[inx] = inow[i] + 1
    if stack ==[]: break

    else:
        i = stack[0]
        stack.pop(0)

print(inow[N-1])