#include #include #include // for std::gcd #include using namespace std; unordered_map memo; double rec(int n, int N) { if (n == 1) { return 0; } if (memo.find(n) != memo.end()) { return memo[n]; } double num = 0; int cnt = 0; for (int M = 1; M <= N; ++M) { if (gcd(n, M) == n) { cnt += 1; continue; } num += rec(gcd(n, M), N); } num += N; memo[n] = num * 1 / (N - cnt); return memo[n]; } int main() { int N; cin >> N; cout << rec(N, N) << endl; return 0; }