#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
//#define N (1000000000+7)
#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

int a[6]={2,3,5,7,11,13};
int b[6]={4,6,8,9,10,12};

int main(void){
	int K;
	cin>>K;
	if(K==0){
		printf("%.10lf\n",(double)0.0);
		return 0;
	}
	int t = 0;
	for(int i=0;i<6;i++){
		for(int j=0;j<6;j++){
			if(a[i]*b[j]==K){
				t++;
			}
		}
	}
	printf("%.16lf\n",(double)t/36);
	return 0;
}