use std::collections::VecDeque;
use std::io::{self, Read};

#[derive(Debug)]
struct Input {
    n: usize,
}

fn next_token(cin_lock: &mut io::StdinLock) -> String {
    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>()
}

fn read_input(cin_lock: &mut io::StdinLock) -> Input {
    Input {
        n: next_token(cin_lock).parse().unwrap(),
    }
}

fn solve(input: Input, _cin_lock: &mut io::StdinLock) {
    let mut visited = vec![false; input.n];

    struct State {
        position: usize,
        cost: i32,
    }
    let mut deq = VecDeque::new();
    deq.push_back(State {
        position: 1,
        cost: 1,
    });

    let mut answer = -1;
    while !deq.is_empty() {
        let state = deq.pop_front().unwrap();

        if visited[state.position - 1] {
            continue;
        }
        visited[state.position - 1] = true;

        if state.position == input.n {
            // 幅優先探索なので最初に見つかったものが最小コスト
            answer = state.cost;
            break;
        }

        let distance = state.position.count_ones() as usize;
        // 範囲に収まる場合は前進する
        if state.position + distance <= input.n {
            deq.push_back(State {
                position: state.position + distance,
                cost: state.cost + 1,
            });
        }
        // 範囲に収まる場合は後退する
        if state.position > distance as usize {
            deq.push_back(State {
                position: state.position - distance,
                cost: state.cost + 1,
            });
        }
    }

    println!("{}", answer);
}

fn main() {
    let cin = io::stdin();
    let mut cin_lock = cin.lock();

    let input = read_input(&mut cin_lock);
    solve(input, &mut cin_lock);
}