#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/


int main() {
	int N;
	cin >> N;
	if (N == 0) {
		cout << 0 << endl;
	}
	else {
		cout << "0.";
		for (int i = 1; i <= N; i++) {
			if (i % 6 == 1) {
				cout << 1;
			}
			else if (i % 6 ==2 ) {
				cout << 4;
			}
			else if (i % 6 ==3 ) {
				cout <<2 ;
			}
			else if (i % 6 ==4 ) {
				cout <<8 ;
			}
			else if (i % 6 ==5 ) {
				cout <<5 ;
			}
			else if (i % 6 ==0 ) {
				cout << 7;
			}
		}
		cout << endl;
	}
}