#![allow(dead_code, unused_variables, unused_macros, unused_imports)] fn solve(v: &mut Vec, current: usize, step: i32) { if v[current - 1] <= step { return; } v[current - 1] = step; let d = current.count_ones() as usize; if d < current { solve(v, current - d, step + 1); } if current + d <= v.len() { solve(v, current + d, step + 1); } } fn main() { input!(n:usize); let max = n as i32 + 1; let mut v = vec![max; n]; solve(&mut v, 1, 1); if v[n - 1] == max { println!("-1"); } else { println!("{}", v[n - 1]); } } mod xxx { // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { input_inner!{$s, $($r)*} }; ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes .by_ref() .map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; input_inner!{next, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($next:expr) => {}; ($next:expr, ) => {}; ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => { let mut $var = read_value!($next, $t); input_inner!{$next $($r)*} }; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } #[macro_export] macro_rules! read_value { ($next:expr, ( $($t:tt),* )) => { ( $(read_value!($next, $t)),* ) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::>() }; ($next:expr, usize1) => { read_value!($next, usize) - 1 }; ($next:expr, bits)=>{ u64::from_str_radix(&$next(), 2).expect("Parse error") }; ($next:expr, hexs)=>{ u64::from_str_radix(&$next(), 16).expect("Parse error") }; ($next:expr, $t:ty) => { $next().parse::<$t>().expect("Parse error") }; } }