package main

import (
	"fmt"
	"strconv"
)

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

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

func getCount(i int, passed []bool, N int, count int) int {
	if i == N {
		return count
	}
	if i < 1 || i > N || passed[i] == true {
		return -1
	}

	count++
	passed[i] = true
	step := countBit(i)
	fowardStep := i + step
	backwardStep := i - step
	fowardCount := getCount(fowardStep, passed, N, count)
	backwardCount := getCount(backwardStep, passed, N, count)

	if fowardCount < 0 || backwardCount < 0 {
		if fowardCount > backwardCount {
			return fowardCount
		} else {
			return backwardCount
		}
	} else {
		if fowardCount < backwardCount {
			return fowardCount
		} else {
			return backwardCount
		}
	}
}

type Info struct {
	count    int
	position int
}

func main() {
	var N int
	N = scan()
	// N = 11
	passed := make([]bool, N)

	var queue []Info
	a := Info{count: 1, position: 1}
	queue = append(queue, a)

	result := Info{count: -1}
	for len(queue) > 0 {
		info := queue[0]
		queue = queue[1:]

		if info.position == N {
			result = info
			break
		}
		if info.position < 1 || info.position > N || passed[info.position] == true {
			continue
		}

		count := info.count + 1
		passed[info.position] = true
		step := countBit(info.position)

		fowardStep := info.position + step
		fowardInfo := Info{count: count, position: fowardStep}
		queue = append(queue, fowardInfo)

		backwardStep := info.position - step
		backwardInfo := Info{count: count, position: backwardStep}
		queue = append(queue, backwardInfo)
	}

	fmt.Print(result.count)
}