#include <bits/stdc++.h> using namespace std; int bfs(int n) { int vis[n + 2]; memset(vis, -1, sizeof(vis)); queue<int> q; vis[1] = 0; q.push(1); while (!q.empty()) { int m = q.front(); q.pop(); if (m - 1 >= 1 && m - 1 <= n && vis[m - 1] == -1) { vis[m - 1] = vis[m] + 1; q.push(m - 1); } if (m + 1 >= 1 && m + 1 <= n && vis[m + 1] == -1) { vis[m + 1] = vis[m] + 1; q.push(m + 1); } if (2 * m >= 1 && 2 * m <= n && vis[m * 2] == -1) { vis[m * 2] = vis[m] + 1; q.push(m * 2); } if (m - 1 == n || m + 1 == n || 2 * m == n) { return vis[n]; } } } int main() { int n; cin >> n; cout << bfs(n); }