#![allow(unused_imports)] #![allow(dead_code)] #![allow(unused_variables)] use std::f64::consts::PI; use std::io::{stdin, stdout, BufReader, Write}; use std::time::Instant; use std::cmp::{min,max,Reverse}; use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque}; //use proconio::{input, source::line::LineSource,marker::Chars,fastout}; //use rand::distributions::{Distribution, Uniform}; //use rand_chacha::{rand_core::SeedableRng, ChaCha8Rng}; //use core::ops::{Add,Sub,Mul,Div}; //use itertools::Itertools; const M1: i64 = 1000_000_007; const M2: i64 = 998244353; macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); let mut next = || { iter.next().unwrap() }; input_inner!{next, $($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_rules! input_inner { ($next:expr) => {}; ($next:expr, ) => {}; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } 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, $t:ty) => { $next().parse::<$t>().expect("Parse error") }; } //#[fastout] fn main(){ //let stdin = stdin(); //let mut source = LineSource::new(BufReader::new(stdin.lock())); input!{ //from &mut source, n: usize, } let mut dp = vec![-1;n+1]; dfs(n,1,1,&mut dp); println!("{}", dp[n]); } fn dfs(n: usize, x: usize,c: i64, dp: &mut Vec){ dp[x] = c; let count = count(x); if count + x <= n && (dp[count + x] == -1 || dp[count + x] > c + 1){ dfs(n,count + x,c+1,dp); } if x - count >= 1 && (dp[x - count] == -1 || dp[x - count] > c +1){ dfs(n,x - count,c+1,dp); } } fn count(x: usize) -> usize{ let mut c = 0; let mut i = 1; while x >= i{ if x & i > 0{ c += 1; } i *= 2; } return c; }