#include <bits/stdc++.h>
 
 using namespace std;
 #define pb push_back
 #define mp make_pair
 #define all(x) (x).begin(),(x).end()
 #define rep(i,n) for(int i=0;i<(n);i++)
 typedef long long ll;
 typedef unsigned long long ull;
 typedef pair<int,int> pii;
 constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
 constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
 
 template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os; }
 template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) {os << "(" << p.first << ", " << p.second << ")"; return os;}
 
 void solve() {
    int N;
    cin >> N;
    int now = 0;
    for (int k = 1; k <= 25; k++) {
        for(int i = 0; i < 1 << k; i++) {
            string s;
            int sum = 0;
            for (int j = 0; j < k; j++) {
                if (i >> j & 1) {
                    s += '5';
                    sum += 5;
                } else {
                    s += '3';
                    sum += 3;
                }
            }
            if (sum % 3 == 0 && s[0] == '5') {
                now++;
                if (now == N) {
                    cout << s << endl;
                    return;
                }
            }

        }
    }

 }
 
 int main() {
     std::cin.tie(0);
     std::ios::sync_with_stdio(false);
     cout.setf(ios::fixed);
     cout.precision(16);
     solve();
     return 0;
 }