#include #include using namespace std; // valを2進数で表現した時の1のビット数 int toPoint(int val) { if (!val) return 0; int point = 0; while (val != 0) { if (!(val & 1) == 0) point++; val >>= 1; } return point; } int main() { int N; cin >> N; int i = 1; int count = 1; bool rireki[N]; for (int j = 0; j < N; j++) rireki[j] = false; while (!(i == N)) { cout << i << "->"; if (rireki[i - 1]) { count = -1; break; } rireki[i - 1] = true; i = (i + toPoint(i) > N) ? (i - toPoint(i)) : (i + toPoint(i)); count++; } cout << i << endl; cout << count << endl; return 0; }