#include <bits/stdc++.h> using namespace std; bool visited[int(1e6 + 1)]; queue<pair<int, int>> q; int bfs(int n) { if (n == 1) return 0; q.push({ 1, 0 }); visited[1] = true; while (!q.empty()) { int pos = q.front().first; int cnt = q.front().second; q.pop(); int next[3] = { pos - 1, pos + 1, pos * 2 }; for (int i = 0; i < 3; i++) { int P = next[i]; if (P == n) { return cnt + 1; } if (P > 0 && P <= n && !visited[P]) { visited[P] = true; q.push({ P, cnt + 1 }); } } } } int main() { int n; scanf("%d", &n); printf("%d", bfs(n)); return 0; }