#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stack>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <functional>
#include <numeric>
#include <chrono>
#include <cstdlib>
using ll = long long;
using namespace std;

const ll MOD = 1e9 + 7;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
// bool operator<(const pair<int, int> &a, const pair<int, int> &b)
// {
//     if (a.first == b.first)
//         return a.second < b.second;
//     return a.first < b.first;
// };

/*unsigned int xor128(void)
{
    static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned int t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
unsigned int xor128rnd(unsigned int m)
{
    return xor128() % m;
}*/

/*bool operator<(const pair<int, int> &a, const pair<int, int> &b)
{
    if (a.first == b.first)
    {
        return a.second < b.second;
    }
    return a.first < b.first;
}*/
set<ll> st;
int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll N;
    cin >> N;
    if (N == 0)
    {
        cout << "0" << endl;
        return 0;
    }
    string ans = "0.";
    ll t = N / 6;
    string tt = "142857";
    while (t--)
    {
        ans += tt;
    }

    t = N % 6;

    for (int i = 0; i < t; ++i)
    {
        switch (i)
        {
        case 0:
            ans += '1';
            break;
        case 1:
            ans += '4';
            break;
        case 2:
            ans += '2';
            break;
        case 3:
            ans += '8';
            break;
        case 4:
            ans += '5';
            break;
        case 5:
            ans += '7';
            break;
        default:
            break;
        }
    }
    cout << ans << endl;
    return 0;
}