#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<climits> //INT_MIN/MAX


using namespace std;

#define FOR(i,s,e) for(int (i)=(s);(i)<(e);(i)++)
#define FORR(i,s,e) for(int (i)=(s);(i)>(e);(i)--)
#define MOD 1000000007
#define llong long long
#define debug(x) cout<<#x<<": "<<x<<endl

llong n;
llong comb[31][31];

void calcomb() {
    int  i, j;
    for (i = 0; i <= 30; i++) {
        for (j = 0; j <= i; j++) {
            if (j == 0 || j == i)
                comb[i][j] = 1;
            else
                comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
        }
    }
}


llong exsum(int a) {
    llong ans = 0;
    FOR(i, 0, a) {
        if ((i + 1) % 3 == 0) {
            ans += comb[a - 1][i];
        }
    }
    return ans;
}


int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    cin >> n;
    calcomb();
    llong count = 0;
    /* 桁数発見 */
    int keta;
    FOR(i, 0, 26) {
        keta = i;
        count += exsum(keta);
        if (count >= n) {
            break;
        }
    }
    count = n - (count - exsum(keta));
    int cc = 0;
    string ans="";
    /* 0が３、1が５ */
    FOR(bit, 1, (1 << keta + 1)) {
        int num = bit;
        int check3 = 0;
        while (num != 0) {
            /*　後の3の倍数かチェックのため　*/
            if (num & 1)
                check3++;
            num = num >> 1;
        }
        /* 最下位は必ず５ */
        if (!(bit & 1))
            continue;
        if (check3 % 3 != 0)
            continue;
        cc++;
        
        if (cc == count) {
            FORR(i,keta-1,-1) {
                if (bit&(1 << i))
                    ans += "5";
                else ans += "3";
            }
            cout << ans << endl;
            return 0;
        }


    }


    return 0;
}