package main

import (
	"fmt"
	"strconv"
)

func scan() (N int) {
	fmt.Scan(&N)
	return
}

func calcSteps(position int) (steps int) {
	s := strconv.FormatInt(int64(position), 2)
	for _, c := range s {
		if c == '1' {
			steps++
		}
	}
	return
}

type Item struct {
	currentPosition int
	numOfSteps      int
}

func main() {
	N := scan()
	// N := 4
	result := -1

	visited := map[int]bool{}
	var queue []Item
	queue = append(queue, Item{
		currentPosition: 1,
		numOfSteps:      1,
	})

	for len(queue) > 0 {
		item := queue[0]
		queue = queue[1:]

		if item.currentPosition == N {
			result = item.numOfSteps
			break
		} else if item.currentPosition < 1 || item.currentPosition > N {
			continue
		} else if visited[item.currentPosition] {
			continue
		}

		visited[item.currentPosition] = true
		steps := calcSteps(item.currentPosition)

		// go foward
		queue = append(queue, Item{
			currentPosition: item.currentPosition + steps,
			numOfSteps:      item.numOfSteps + 1,
		})
		// go backward
		queue = append(queue, Item{
			currentPosition: item.currentPosition - steps,
			numOfSteps:      item.numOfSteps + 1,
		})
	}

	fmt.Print(result)
}