#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

string X;
int memo[100][2][15];
int rec(int i, bool lt, int m) {
	int &r = memo[i+1][lt][m];
	if(r != -1) return r;
	if(i == -1) return r = m == 0 ? 1 : 0;
	r = 0;
	int x = X[i] - '0';
	if(lt || 3 <= x) r += rec(i-1, lt || 3 < x, (m * 10 + 3) % 15);
	if(lt || 5 <= x) r += rec(i-1, lt || 5 < x, (m * 10 + 5) % 15);
	amin(r, INF);
	return r;
}

int main() {
	int N;
	while(cin >> N) {
		int len = 1;
		while(1) {
			X.assign(len, '5');
			mset(memo, -1);
			int t = rec(len - 1, false, 0);
			if(t >= N) break;
			N -= t;
			++ len;
		}
		for(int i = len - 1; i >= 0; -- i) {
			X[i] = '3';
			mset(memo, -1);
			if(rec(len - 1, false, 0) < N)
				X[i] = '5';
		}
		reverse(all(X));
		puts(X.c_str());
	}
	return 0;
}