#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};
 

int main(){
    int n;cin >> n;
    vector<vector<int>> dp(28,vector<int> (3,0));
    dp[1][1] = 1;
    for (int i = 1; i < 27; i++) {
        for (int j = 0; j < 3; j++) {
            dp[i+1][(j+1)%3] += dp[i][j];
            dp[i+1][j] += dp[i][j];
        }
    }
    int t = 0, sum = 0;
    for (int i = 0; i <= 28; i++) {
        sum += dp[i][0];
        if(sum >= n){
            for (int j = 0; j < i; j++) {
                n -= dp[j][0];
            }
            t = i;
            break;
        }
    }
    string ans = "";
    int p = 0;
    for (int i = t-1; i >= 0; i--) {
        if(dp[i][p]){
            if(dp[i][p] < n){
                n -= dp[i][p];
                ans += '5';
                p = (p + 2) % 3;
            }
            else{
                ans += '3';
            }
        }
        else{
            ans += '5';
        }
    }
    cout << ans << endl;
    return 0;
}