#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
#include<unordered_set>
#include<unordered_map>
using namespace std;
string s = "5533533555333355355553555";

string ss;
int main() {
	int n;
	cin >> n;
	long long int mint = 0;
	long long int maxt = 1;
	for (int i = 0;i < s.size();i++) {
		maxt <<= 1LL;
		if (s[i] == '3') {

		}
		else {
			maxt |= 1LL;
		}
	}
	int countt = 0;
	long long int i = 2;
	int ket = 0;
	while (countt < n) {
		int k = __builtin_popcount(i);
		if (k == 1) {
			ket++;
		}
		k--;
		if ((i & 1)) {

		}
		else {
			i++;
			continue;
		}
		if (k % 3 == 0) {
			countt++;
		}
		i++;
	}
	i--;
	while (i > 1LL) {
		if ((i&1LL)) {
			ss.push_back('5');
			//continue;
		}
		else {
			ss.push_back('3');
		}
		i >>= 1;
	}
	reverse(ss.begin(), ss.end());
	cout << ss << endl;
	return 0;
}