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


/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define pb push_back


/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;


/* constant */
const int inf = pow(2, 62);
const int mod = 1e9 + 7;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};
const string alpha = "abcdefghijklmnopqrstuvwxyz";

/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}



/* main */

int n;
double dp[1000][2][2][2][2][2][2];

double dfs(int i, bool a, bool b, bool c, bool d, bool e, bool f){


    if(dp[i][a][b][c][d][e][f] > -1){
        return dp[i][a][b][c][d][e][f];
    }

    if(i == n){
        if(a && b && c && d && e && f){
            return 1.0/pow(6, n);
        }else{
            return 0.0;
        }
    }

    return dp[i][a][b][c][d][e][f] =  dfs(i + 1, true, b, c, d, e, f) + dfs(i + 1, a, true, c, d, e, f) + dfs(i + 1, a, b, true, d, e, f)
     + dfs(i + 1, a, b, c, true, d, f) + dfs(i + 1, a, b, c, d, true, f)  + dfs(i + 1, a, b, c, d, e, true);



}





signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);

    n = input();
    
    Fill(dp, -1.0);

    if(n > 900){
        print(1.000000000);
        return 0;
    }



    printf("%0.9f\n", dfs(0, 0, 0, 0, 0, 0, 0));



    
    






}