#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
#define EPS 1e-10
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
typedef pair<int, int> P;

char *endptr;
int kazu = 0;
int N;

typedef pair<int, string> PP;

void bfs()
{
	priority_queue<PP, vector<PP>, greater<PP> > que;
	que.push(PP(0, ""));
	while (true)
	{
		string s = que.top().second; que.pop();
		//cout << "s = " << s << endl;
		if (s.length() > 25) break;
		ll num = strtoll(s.c_str(), &endptr, 10);
		//cout << "num = " << num << endl;
		if (num % 15 == 0)
		{
			kazu++;
			if (kazu == N)
			{
				cout << s << endl;
				break;
			}
		}
		que.push(PP(s.length() + 1, "3" + s));
		que.push(PP(s.length() + 1, "5" + s));
	}
}


int main()
{
	cin >> N;
	bfs();
	
	return 0;
}