#include<bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<vector<double>> dp(n + 1, vector<double>(1 << 25));
    dp[0][0] = 1;
    for(int i = 0; i < n; i++){
        int rem = 99 - i;
        for(int j = 0; j < (1 << 25); j++){
            if(dp[i][j] == 0)continue;
            int cnt = 25 - __builtin_popcount(j);
            dp[i + 1][j] += dp[i][j] * (rem - cnt) / rem;
            if(cnt == 0)continue;
            for(int k = 0; k < 25; k++){
                if(j >> k & 1)continue;
                dp[i + 1][j | (1 << k)] += dp[i][j] * cnt / rem;
            }
        }
    }
    vector<int> cand;
    int S = 0b11111;
    cerr << (bitset<25>(S));
    for(int i = 0; i < 5; i++){
        cand.push_back(S << 5 * i);
    }
    S = 0b0000100001000010000100001;
    for(int i = 0; i < 5; i++){
        cand.push_back(S << i);
    }
    cand.push_back(0);
    for(int i = 0; i < 5; i++){
        cand.back() |= 1 << i * 5 + i;
    }
    cand.push_back(0);
    for(int i = 0; i < 5; i++){
        cand.back() |= 1 << i * 5 + 5 - i;
    }
    double ans = 0;
    for(int i = 0; i < (1 << 25); i++){
        if(__builtin_popcount(i) < 5)continue;
        int cnt = 0;
        for(auto &&S: cand){
            cnt += ((S & i) == S);
        }
        ans += cnt * dp[n][i];
    }
    printf("%.15lf\n", ans);
}