int n;

int solve(int a, int b, int dep) {
    if(a < b) swap(a, b);
    if(a == 1) return dep - (b == 0);
    return solve(a % b, b, dep + a / b);
}

signed main() {
    seriy();
    cin >> n;
    int ans = INF;
    for(int i = 1; i <= n; i++) {
        if(__gcd(n, i) == 1) {
            ans = min(ans, solve(n, i, 0));
        }
    }
    cout << ans;
    return 0;
}