#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

//3と5のみからなる整数
//末尾は5, 5の個数が3の倍数個

signed main(void) {
    int n;
    cin >> n;
    int cnt = 0;
    loop(i,3,30)rep(bit, 1 << i)if(bit & 1){
        int num = __builtin_popcountll(bit);
        if(num % 3 == 0)cnt++;
        string s = "";
        if(cnt == n){
            rep(j,i){
                if(bit & (1 << j))s = "5" + s;
                else s = "3" + s;
            }
            cout << s << endl;
            return 0;
        }
    }
}