package main

import (
	"container/list"
	"fmt"
)

func bitcount(a int) int {
	var b int
	for a > 0 {
		b += a & 1
		a >>= 1
	}
	return b
}

func main() {
	max := 100000000
	var n int
	fmt.Scan(&n)
	dp := make([]int, n+1)
	for i := range dp {
		dp[i] = max
	}
	dp[1] = 1
	q := list.New()
	q.PushBack(1)
	for q.Len() > 0 {
		now := q.Front().Value
		q.Remove(q.Front())
		move := bitcount(now.(int))
		for i := -move; i <= move; i += move * 2 {
			next := now.(int) + i
			if next > 1 && next <= n && dp[next] == max {
				dp[next] = dp[now.(int)] + 1
				q.PushBack(next)
			}
		}
	}
	if dp[n] == max {
		dp[n] = -1
	}
	fmt.Println(dp[n])

}