#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=(r)-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll k;cin >> k;
    vector<vector<double>> dp(100000,vector<double>(k+1));
    dp[0][0]=1;
    rep(i,100000-1){
        rep(j,k){
            rep(x,6){
                if(x+1+j<=k){
                    dp[i+1][x+1+j]+=dp[i][j]/6;
                }
                else {
                    dp[i+1][0]+=dp[i][j]/6;
                }
            }
        }
    }
    CST(10);
    double ans=0;
    rep(i,100000)ans+=dp[i][k]*i;
    cout << ans <<endl;
    /*rep(i,10){
        rep(j,k){
            cout << dp[i][j] <<" ";
        }
        cout << endl;
    }*/
}