# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
from collections import *
from functools import *
from itertools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())
dist = defaultdict(lambda: -1)
v = deque()
dist[1]=1
v.append(1)
while v:
    x = v.popleft()
    delta = bin(x).count('1')
    
    e = [x-delta,x+delta]
    
    for ix in e:
        if dist[ix]!=-1:
            continue
        if ix>N:
            continue
        dist[ix]=dist[x]+1
        v.append(ix)
print(dist[N])