/* -*- coding: utf-8 -*-
 *
 * 567.cc: No.567 コンプリート - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int D = 6;
const int DBITS = 1 << D;

/* typedef */

typedef double mat[DBITS][DBITS];

/* global variables */

void matmul(int n, const mat a, const mat b, mat c) { // a*b -> c
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      c[i][j] = 0.0;
      for (int k = 0; k < n; k++) c[i][j] += a[i][k] * b[k][j];
    }
}

void matpow(int n, const mat a, int b, mat c) { // a^b -> c
  mat q, t;
  for (int i = 0; i < n; i++) {
    fill(c[i], c[i] + n, 0.0);
    c[i][i] = 1.0;
  }
  memcpy(q, a, sizeof(mat));

  while (b) {
    if (b & 1) {
      matmul(n, c, q, t);
      memcpy(c, t, sizeof(mat));
    }

    matmul(n, q, q, t);
    memcpy(q, t, sizeof(mat));
    b >>= 1;
  }
}

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  mat a, c;
  for (int i = 0; i < DBITS; i++) fill(a[i], a[i] + DBITS, 0.0);

  for (int bits = 0; bits < DBITS; bits++)
    for (int d = 0, bd = 1; d < D; d++, bd <<= 1)
      a[bits | bd][bits] += 1.0 / D;

  matpow(DBITS, a, n, c);
  printf("%.8lf\n", c[DBITS - 1][0]);
}