#include using namespace std; // 基本テンプレート struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(0);}}star; #define P(x) cout << (x) << endl #define p(x) cout << (x) #define ALL(c) (c).begin(), (c).end() #define RALL(c) (c).rbegin(), (c).rend() #define MAT(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define VV(type, c, m, n, i) vector> c(m, vector(n, i)); #define REP(i,a,n) for(int i=(a), i##_len=(n); in; --i) #define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c))) #define PB push_back #define EM emplace #define EB emplace_back #define BI back_inserter #define MP make_pair #define cauto const auto& #define UNIQUE(v) v.erase( unique(ALL(v)), v.end() ); #define len(x) ((int)(x).size()) #define GET_ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0])) // 型 typedef long long ll; typedef unsigned long long ull; typedef pair pii; typedef pair pss; typedef pair psi; typedef pair pis; typedef vector vi; typedef vector vd; typedef vector vl; typedef vector vll; typedef vector vs; // 定数 #define PI acos(-1.0) constexpr int EPS = (1e-9); constexpr int INF = 100000000; #define MAX 10001 vi N(MAX + 1, INF); int limit; int bit_num(int n) { if (n == 1 || n == 2) return 1; int sum = 1; while (n > 2) {sum += (n % 2 == 1); n /= 2; } return sum; } int mas(int n) { if (n > limit) return 0; if(N[n + bit_num(n)] > N[n] + 1) {N[n + bit_num(n)] = N[n] + 1; mas(n + bit_num(n)); }; if(N[n - bit_num(n)] > N[n] + 1) {N[n - bit_num(n)] = N[n] + 1; mas(n - bit_num(n)); }; return 0; } int main() { N[0] = N[1] = 1; cin >> limit; mas(1); P(N[limit] != INF ? N[limit] : -1); return 0; }