#!/usr/bin/env python
import sys
sys.setrecursionlimit(10000)
N = int(input())
F = [[0 for j in range(2)] for i in range(N+1)]
for i in range(1,N+1):
  F[i][0] = format(i,'b').count('1')
  # print(i,format(i,'b'),format(i,'b').count('1'))
F[N][1] = -1
F[1][1] = 1
def check(F, p):
  n = F[p][0]
  if p + n < N + 1 and (F[p + n][1] < 1 or F[p + n][1] > F[p][1]):
    F[p + n][1] = F[p][1] + 1
    F = check(F, p + n)
  if p - n > 0 and (F[p - n][1] < 1 or F[p - n][1] > F[p][1]):
    F[p - n][1] = F[p][1] + 1
    F = check(F, p - n)
  return F
F = check(F, 1)
print(F[N][1])