#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
/////////
int bitcount64(LL bits)
{
    bits = (bits & 0x5555555555555555) + (bits >> 1 & 0x5555555555555555);
    bits = (bits & 0x3333333333333333) + (bits >> 2 & 0x3333333333333333);
    bits = (bits & 0x0f0f0f0f0f0f0f0f) + (bits >> 4 & 0x0f0f0f00f0f0f0ff);
    bits = (bits & 0x00ff00ff00ff00ff) + (bits >> 8 & 0x00ff00ff00ff00ff);
    bits = (bits & 0x0000ffff0000ffff) + (bits >>16 & 0x0000ffff0000ffff);
	return (bits & 0x00000000ffffffff) + (bits >>16 & 0x00000000ffffffff);
}
void show(LL i, LL j){
	for(LL bit=i-1;bit>=0;--bit){
		if( j & (((LL)1)<<bit) ){
			cout << '5';
		}else{
			cout << '3';
		}
	}
	cout << '\n';
}
void solve(){
	int N;
	cin >> N;
	int num = 0;
	
	int A,B;
	int i,j;
	for(i=3;i<=25;++i){
		for(j=0; j < (1<<i);++j){
			if(j%2 == 0 ) continue;
			B = bitcount64(j);//5
			A = i-B;//3
			if( B % 3 != 0 ) continue;
			++num;
			if( N == num ){
				show(i,j);
				return;
			}
		}
	}
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	//cpp
	solve();
	return 0;
}