#include using namespace std; using i8 = int8_t; using i16 = int16_t; using i32 = int32_t; using i64 = int64_t; using u8 = uint8_t; using u16 = uint16_t; using u32 = uint32_t; using u64 = uint64_t; using f32 = float; using f64 = double; using vi32 = std::vector; using vu32 = std::vector; using vf32 = std::vector; using vi64 = std::vector; using vu64 = std::vector; using vf64 = std::vector; using vvi32 = std::vector; using vvu32 = std::vector; using vvf32 = std::vector; using vvi64 = std::vector; using vvu64 = std::vector; using vvf64 = std::vector; using pi32 = std::pair; using pu32 = std::pair; using pf32 = std::pair; using pi64 = std::pair; using pu64 = std::pair; using pf64 = std::pair; #define ALL(obj) (obj).begin(),(obj).end() #define RALL(obj) ((obj).rbegin(),(obj).rend()) #define SZ(obj) ((i32)(obj).size()) #define EACH(it,o) for(auto it=(o).begin();it!=(o).end();++it) #define IN(l,n,r) ((l)<=(n) && (n)<(r)) #define UNIQUE(obj) (obj).erase(std::unique(ALL(obj)),(obj).end()) #define CLR(ar,val) memset(ar, val, sizeof(ar)) #define FOR(i,a,b) for(i32 i=(i32)(a); i<(i32)(b); i++) #define RFOR(i,a,b) for(i32 i=(i32)(b)-1;i>=(i32)(a);--i) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) #define PRINT(n) cout << (n) <<"\n"; #define cauto const auto& #define mp make_pair #define pb push_back const i32 INF = 0x3F3F3F3F; const i64 INF64 = 0x3F3F3F3F3F3F3F3F; const f64 EPS = 1e-8; const i32 MOD = 1000000007; static const f64 PI = 3.1415926535897932; static const f64 NAPIER = 2.7182818284590452; const char alphabetl[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'}; const char alphabetu[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; i32 dx[4] = {1, 0, -1, 0}; i32 dy[4] = {0, 1, 0, -1}; template inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } i64 BIT_COUNT_ONES(i64 x) { return __builtin_popcountll(x); } i64 BIT_COUNT_ZEROS(i64 x) { return 64 - BIT_COUNT_ONES(x); } //input pair tuple vector template std::istream& operator >> (std::istream& is,std::pair& p){is>>p.first>>p.second;return is;} template std::istream& operator >> (std::istream& is,std::tuple& t){is >> std::get<0>(t);return is;} template std::istream& operator >> (std::istream& is,std::tuple& t){is >> std::get<0>(t) >> std::get<1>(t);return is;} template std::istream& operator >> (std::istream& is,std::tuple& t){is >>std::get<0>(t)>>std::get<1>(t)>>std::get<2>(t);return is;} template std::istream& operator >> (std::istream& is,std::tuple& t){is >> std::get<0>(t)>>std::get<1>(t)>>std::get<2>(t)>>std::get<3>(t);return is;} template std::istream& operator >> (std::istream& is, const std::tuple& t){is >> std::get<0>(t) >> std::get<1>(t) >> std::get<2>(t) >> std::get<3>(t) >> std::get<4>(t);return is;} template std::istream& operator >> (std::istream& is, const std::tuple& t){is >> std::get<0>(t) >> std::get<1>(t) >> std::get<2>(t) >> std::get<3>(t) >> std::get<4>(t) >> std::get<5>(t);return is;} template std::istream& operator >> (std::istream& is, const std::tuple& t){is >> std::get<0>(t) >> std::get<1>(t) >> std::get<2>(t) >> std::get<3>(t) >> std::get<4>(t) >> std::get<5>(t) >> std::get<6>(t);return is;} template std::istream& operator >> (std::istream& is,std::vector& as){REP(i,SZ(as))is >>as[i];return is;} //output set pair map tuple vector template std::ostream& operator << (std::ostream& os, const std::set& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os< std::ostream& operator << (std::ostream& os, const std::pair& p){os< std::ostream& operator << (std::ostream& os, const std::map& m){bool isF=true;for(auto& p:m){if(!isF)os< std::ostream& operator << (std::ostream& os, const std::tuple& t){os << std::get<0>(t);return os;} template std::ostream& operator << (std::ostream& os, const std::tuple& t){os << std::get<0>(t)<<" "<(t);return os;} template std::ostream& operator << (std::ostream& os, const std::tuple& t){os << std::get<0>(t)<<" "<(t)<<" "<(t);return os;} template std::ostream& operator << (std::ostream& os, const std::tuple& t){os << std::get<0>(t)<<" "<(t)<<" "<(t)<<" "<(t);return os;} template std::ostream& operator << (std::ostream& os, const std::tuple& t){os << std::get<0>(t)<<" "<(t)<<" "<(t)<<" "<(t)<<" "<(t);return os;} template std::ostream& operator << (std::ostream& os, const std::tuple& t){os << std::get<0>(t)<<" "<(t)<<" "<(t)<<" "<(t)<<" "<(t)<<" "<(t);return os;} template std::ostream& operator << (std::ostream& os, const std::tuple& t){os << std::get<0>(t)<<" "<(t)<<" "<(t)<<" "<(t)<<" "<(t)<<" "<(t)<<" "<(t);return os;} template std::ostream& operator << (std::ostream& os, const std::vector& as){REP(i,as.size()){if(i!=0)os<<" "; os< std::ostream& operator << (std::ostream& os, const std::vector>& as){REP(i,SZ(as)){if(i!=0)os<> N; vi64 dp(N+1, -1); dp[1] = 1; queue q; q.push(1); while(!q.empty()) { i64 n = q.front(); q.pop(); if(n == N) break; i64 nn = n + BIT_COUNT_ONES(n); if (0 < nn && nn <= N && dp[nn] == -1) { q.push(nn); dp[nn] = dp[n] + 1; } i64 nb = n - BIT_COUNT_ONES(n); if (0 < nb && nb <= N && dp[nb] == -1) { q.push(nb); dp[nb] = dp[n] + 1; } } cout << dp[N] << endl; }