fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn main() {
    let n:u32 = read();

    #[derive(Debug, Clone)]
    struct Node {
        to: Vec<usize>,
        done: bool,
        cost: i32,
    }

    let mut nodes: Vec<Node> = vec![];
    for i in 1..=n {
        let prev_idx = i as i32 - 1 - i.count_ones() as i32;
        let next_idx = i as i32 - 1 + i.count_ones() as i32;
        let done = false;
        let cost = -1;
        let mut to = vec![];
        if prev_idx >= 0 {
            to.push(prev_idx as usize);
        }
        if next_idx < n as i32 {
            to.push(next_idx as usize);
        }
        nodes.push(Node{to, done, cost});
    }

    nodes[0].cost = 0;

    loop {
        let mut done_node_idx: Option<usize> = None;
        let max = nodes.len();
        for i in 0..max {
            if nodes[i].done || nodes[i].cost < 0 {
                continue;
            }
            if done_node_idx.is_none() || nodes[i].cost < nodes[done_node_idx.unwrap()].cost {
                done_node_idx = Some(i);
            }
        }

        if done_node_idx.is_none() {
            break;
        }

        // let done_node = &mut nodes[done_node_idx.unwrap()];
        nodes[done_node_idx.unwrap()].done = true;

        for toidx in nodes[done_node_idx.unwrap()].to.clone() {
            let cost = nodes[done_node_idx.unwrap()].cost + 1;
            if nodes[toidx].cost < 0 || cost < nodes[toidx].cost {
                nodes[toidx].cost = cost;
            }
        }
    }

    if nodes[nodes.len()-1].cost >= 0 {
        println!("{:?}", nodes[nodes.len()-1].cost + 1);
    } else {
        println!("-1");
    }
}