#!/usr/bin/env python3
#fileencoding: utf-8

from collections import deque

def popcnt(i):
    count = 0
    while i > 0:
        count += (i&0x1)
        i >>= 1
    return count

def bfs(N):
    visited = [0] * N
    queue = deque()
    queue.append((1,1))  # (index, score)
    while queue:
        p = queue.popleft()
        if visited[p[0]-1] == 1:
            continue
        visited[p[0]-1] = 1
        if p[0] == N:
            return p[1]
        bits = popcnt(p[0])
        if p[0]+bits <= N:
            queue.append((p[0]+bits, p[1]+1))
        if p[0]-bits > 0:
            queue.append((p[0]-bits,p[1]+1))
    return -1

print(bfs(int(input())))