#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int K;
double dp[1500];
int main(){
    cin>>K;
    REP(i,0,K){
        dp[i+6]=1;
        REP(j,1,7) dp[i+6]+=dp[i+6-j]/6;
    }
    p(dp[K-1+6]);
    return 0;
}