#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define int long long

const int num[2] = { 3, 5 };
int N, cnt;
string ans;
int memo[30][15];

int DFS(int dep, int rest, string s)
{
	if (cnt == N) return 0;
	if (dep == 0)
	{
		if (rest) return 0;
		if (++cnt == N) ans = s;
		return 1;
	}
	if (memo[dep][rest] != -1 && cnt + memo[dep][rest] < N)
	{
		cnt += memo[dep][rest];
		return memo[dep][rest];
	}
	memo[dep][rest] = 0;
	for (int i = 0; i < 2; i++)
	{
		memo[dep][rest] += DFS(dep - 1, (rest * 10 + num[i]) % 15, s + "35"[i]);
	}
	return memo[dep][rest];
}

signed main()
{
	fill_n((int*)memo, 30 * 15, -1);
	cin >> N;
	for (int i = 1; ; i++)
	{
		DFS(i, 0, "");
		if (cnt == N) break;
	}
	cout << ans << endl;
	return 0;
}