#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001
int get(int n){
	if(n==8)return 2;
	if(n==0||n==6||n==9||n==4)return 1;
	return 0;
}

long long dp[18][2][2];
bool f[18][2][2];

long long dfs(string &s,string &t,int a,int b,int c){
	if(a==s.size()){
		return 1;
	}
	if(f[a][b][c])return dp[a][b][c];
	long long ret= 0;
	rep(i,10){
		if(t[a]!='*'){
			if(i!=t[a]-'0')continue;
			if(t[a]=='0'&&c==0)continue;
		}
		int aa = a+1;
		int bb = b;
		int cc = c;
		if(i!=0)cc = 1;
		if(b==0&&s[a]-'0' < i)continue;
		if(s[a]-'0' > i)bb = 1;
		ret += dfs(s,t,aa,bb,cc);
	}
	dp[a][b][c] = ret;
	f[a][b][c] = true;
	return ret;
}

long long get(string s,string t){
	//cout<<s<<','<<t<<endl;
	rep(i,18){
		rep(j,2){
			rep(k,2){
				dp[i][j][k] = 0;
				f[i][j][k] = false;
			}
		}
	}
	
	return dfs(s,t,0,0,0);
	
}

long long gg(long long n){
	string s = to_string(n);
	long long ret = 0;
	rep(i,10){
		int c = get(i);
		if(c!=0){
			rep(j,s.size()){
				string t(s.size(),'*');
				t[j] = '0'+i;
				ret += get(s,t) * c;
			}
		}
	}
	return ret;
}

int main() {
    
	long long K;
	cin>>K;
	long long ng=  0,ok = 100000000000000000;
	//cout<<gg(100000000000000000)<<endl;
	//return 0;
	while(ok-ng>1LL){
		long long mid = (ok+ng)/2;
		if(gg(mid)>=K)ok = mid;
		else ng = mid;
		
	}
	//cout<<ok<<','<<gg(ok)<<endl;
	if(gg(ok)==K)cout<<ok<<endl;
	else cout<<-1<<endl;
	
	
    return 0;
}