use std::collections::VecDeque;
use std::io::{stdin, Read, StdinLock};
use std::str::FromStr;

struct Input {
    n: usize,
}

fn read_input(cin_lock: &mut StdinLock) -> Input {
    let n = next_token(cin_lock);
    Input { n }
}

fn solve(input: Input) -> i32 {
    let mut check_points = vec![-1; input.n + 1];
    check_points[1] = 1;

    let mut deque: VecDeque<usize> = VecDeque::new();
    deque.push_back(1);
    while let Some(n) = deque.pop_front() {
        if check_points[input.n] >= 0 {
            break;
        }

        let bc = n.count_ones() as usize;

        if n + bc < check_points.len() && check_points[n + bc] < 0 {
            check_points[n + bc] = check_points[n] + 1;
            deque.push_back(n + bc);
        }

        if n > bc && check_points[n - bc] < 0 {
            check_points[n - bc] = check_points[n] + 1;
            deque.push_back(n - bc);
        }
    }

    return check_points[input.n];
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_solve() {
        assert_eq!(solve(Input { n: 1 }), 1);
        assert_eq!(solve(Input { n: 2 }), 2);
        assert_eq!(solve(Input { n: 3 }), 3);
        assert_eq!(solve(Input { n: 5 }), 4);
    }

    #[test]
    fn test_solve_not_found() {
        assert_eq!(solve(Input { n: 4 }), -1);
    }

    #[test]
    fn test_solve_require_back() {
        assert_eq!(solve(Input { n: 11 }), 9);
    }
}

fn next_token<T: FromStr>(cin_lock: &mut StdinLock) -> T {
    cin_lock
        .by_ref()
        .bytes()
        .map(|c| c.unwrap() as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect::<String>()
        .parse::<T>()
        .ok()
        .unwrap()
}

fn main() {
    let cin = stdin();
    let mut cin_lock = cin.lock();
    let input = read_input(&mut cin_lock);

    println!("{}", solve(input));
}