#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::collections::VecDeque;

#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($t:ty) =>
        (rl().parse::<$t>().unwrap());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.trim_end().to_owned()
}

trait IteratorExt: Iterator + Sized {
    fn vec(self) -> Vec<Self::Item> {
        self.collect()
    }
}
impl<T: Iterator> IteratorExt for T {}

fn main() {
    let n = read!(usize; 1);
    let n = n[0];

    if n == 1 {
        println!("1");
        return;
    }

    // DFS
    // 開始点は1
    let mut visited = Vec::with_capacity(n+1);
    for _ in 0..n+1 { visited.push(false);}

    let mut reserved: VecDeque<_> = VecDeque::new();
    // (点, 最短手数)
    reserved.push_back((1, 1));
    let ans = 'outer: loop {
        if let Some((point, min)) = reserved.pop_front() {
            visited[point] = true;

            let d = (point as usize).count_ones() as usize;
            if point > d {
                let tmp = point - d;
                if visited[tmp] == false {
                    reserved.push_back((tmp, min+1));
                }
            }
            if point + d <= n {
                let tmp = point + d;
                if tmp == n { break 'outer min + 1; }
                if visited[tmp] == false {
                    reserved.push_back((tmp, min+1));
                }
            }
        }
        else {
            break 'outer -1;
        }
    };

    println!("{}", ans);

}