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

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

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 answer = bfs(input).unwrap_or(-1);
    println!("{}", answer);
}

fn bfs(input: Input) -> Option<i32> {
    #[derive(Debug)]
    struct Op {
        n: i32,
        pos: i32,
    }

    let bits = (1..=input.n).map(|i| i.count_ones() as i32).collect::<Vec<_>>();
    let mut visited = vec![false; input.n as usize];

    let mut q = VecDeque::new();
    q.push_back(Op {n: 1, pos: 1});

    while !q.is_empty() {
        let op = q.pop_front().unwrap();
        if op.pos == input.n {
            return Some(op.n);
        }

        let i = (op.pos - 1) as usize;
        if visited[i] {
            continue;
        }
        visited[i] = true;

        let distance = bits[i as usize];
        let next_n = op.n + 1;

        let f = op.pos + distance;
        if f <= input.n {
            q.push_back(Op { n: next_n, pos: f });
        }

        let b = op.pos - distance;
        if b > 0 {
            q.push_back(Op { n: next_n, pos: b });
        }
    }

    None
}

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

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