from collections import deque
N=int(input())
a=[0]*10001

for i in range(1,10001):
  a[i]=i.bit_count()
q=deque([])
q.append(1)
dist=[-1]*(N+1)
dist[1]=1
while q:
  v=q.popleft()
  g=a[v]
  if 0<v-g and dist[v-g]==-1:
    q.append(v-g)
    dist[v-g]=dist[v]+1
  if v+g<=N and dist[v+g]==-1:
    q.append(v+g)
    dist[v+g]=dist[v]+1
print(dist[N])