#include #include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf 1000000001 int main(){ int n; cin>>n; queue Q; Q.push(1); vector dis(n+1,Inf); dis[01] = 1; while(Q.size()>0){ int u =Q.front(); Q.pop(); int nxt = __builtin_popcount(u); for(int i=-1;i<=1;i+=2){ int v = u + nxt * i; if(v<=0||v>n)continue; if(dis[v]==Inf){ dis[v] = dis[u]+1; Q.push(v); } } } int ans = dis.back(); if(ans==Inf)ans = -1; cout<