<?php
$n = trim(fgets(STDIN));
$queue = array();
$point = array_fill(0, $n, -1);
$move = 1;
$point[0] = $move;
$queue[] = 1;

// 幅優先探索
while (count($queue) > 0) {
	// 処理対象のマスを取り出す
	$value = array_shift($queue);
	
	// 移動個数を計算する
	$bit = decbin($value);
	$counts = count_chars($bit, 1);
	$count = $counts[ord('1')];
	
	// 移動回数を更新
	$move = $point[$value-1]+1;
	
	// 移動先を訪問
	if ( (($value+$count) <= $n) && ($point[$value+$count-1] === -1) ) {
		$point[$value+$count-1] = $move;
		$queue[] = $value+$count;
	}
	if ( (($value-$count) > 1) && ($point[$value-$count-1] === -1) ) {
		$point[$value-$count-1] = $move;
		$queue[] = $value-$count;
	}
}
echo $point[$n-1] .PHP_EOL;