#include <bits/stdc++.h>
#include <cmath>
#include <climits>
#include <cstdio>

using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define DEBUG(x) cout<<#x<<": "<<x<<endl

typedef pair<int,int> P;
typedef long long int LL;
typedef pair<LL,LL> LP;

long long C(int n, int r){
	long long res = 1;
	REP(i,r){
		res *= (n-i);
		res /= (i+1);
	}
	return res;
}

int bitcount(LL x){
	int res = 0;
	while(x != 0){
		if(x&1){
			res++;
		}
		x = x>>1;
	}
	return res;
}

LL ketan[26];

int main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	FOR(i,2,26){
		int x = 2;
		LL m = ketan[i-1];
		while(x <= i){
			m += C(i,x);
			x += 3;
		}
		ketan[i] = m;
	}
	int N;
	cin >> N;
	int keta = 0;
	REP(i,26){
		if(N <= ketan[i] && !keta) keta = i;
	}
	//DEBUG(keta);
	int n = ketan[keta-1];
	string ans;
	REP(i,1<<keta){
		int bc = bitcount(i);
		if(bc%3 == 2){
			n++;
			if(n == N){
				REP(j,keta){
					if(i>>j & 1){
						ans += "5";
					}else{
						ans += "3";
					}
				}
			}
		}
	}
	RREP(i,SZ(ans))	cout << ans[i];
	cout << 5 << endl;
}