#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
// 04689
vector<int>v = { 0,4,6,8,9 };
vector<map<long long, long long>>mp(5);
long long dp(long long n, int type) {
	if (n <= 0)return 0;
	if (mp[type].count(n)) return mp[type][n];
	long long val = 0;
	rep(i, 10) {
		if (v[type] == i) {
			if (i <= n % 10) {
				val += n / 10;
				if (0 != v[type])val++;
			}
			else {
				val += n / 10;
			}

		}
		if (i <= n % 10) {
			val += dp(n / 10, type);
		}
		else {
			val += dp(n / 10 - 1, type);
		}
	}
	mp[type][n] = val;
	return val;
}
long long calc(long long n) {
	long long ret = 0;
	rep(i, v.size()) {
		long long get = dp(n, i);
		ret += get;
		if (8 == v[i])ret += get;
	}
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long k; cin >> k;
	long long ng = 0;
	long long ok = LINF + 1;
	while (1 < abs(ok - ng)) {
		long long mid = (ng + ok) / 2;
		auto check = [&]() {
			return  k <= calc(mid);
		};
		if (check()) ok = mid;
		else ng = mid;
	}
	if (k == calc(ok))cout << ok << endl;
	else cout << -1 << endl;
	return 0;
}