#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}} #define dame { cout << "No" << endl; return 0;} #define dame1 { cout << -1 << endl; return 0;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define show(x) cerr<<#x<<" = "<; using pil = pair; using pli = pair; using pii = pair; using tp = tuple; using vi = vector; using vl = vector; using vs = vector; using vb = vector; using vpii = vector; using vpli = vector; using vpll = vector; using vpil = vector; using vvi = vector>; using vvl = vector>; using vvs = vector>; using vvb = vector>; using vvpii = vector>; using vvpli = vector>; using vvpll = vector; using vvpil = vector; using mint = modint998244353; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; struct math_lib{ vvl div,mul; void div_init(int n){ div.resize(n+1); mul.resize(n+1); for(ll i = 1;i <= n;i++){ for(ll j = i;j <= n;j+=i){ div[j].pb(i); mul[i].pb(j); } } return; } vl divisor(ll x){ vl res; for(ll i=1;i*i<=x;i++){ if (x%i != 0) continue; res.pb(i); if (i*i != x) res.pb(x/i); } sort(rng(res)); return res; } ll sqrt(ll x) { ll l = 0, r = ll(2e9)+1; while (l+1= LLONG_MAX/a) break; tmp *= a; ret++; } ret--; return ret; } ll pow(ll x , ll a){ assert(x > 0); assert(a >= 0); ll ret = 1; rep(_,a){ if (ret >= LLONG_MAX/x){ ret = -1; break; }else{ ret *= x; } } return ret; } ll base(ll x,int a){ ll ans=0,y; for (ll i=0;x>0;i++){ y = x/a; ans += (x - y*a)*pow(10,i); x = y; } return ans; } string baseS(ll x,int a){ string ans; ll y; for (ll i=0;x>0;i++){ y = x/a; ans += '0' + (x - y*a); x = y; } reverse(rng(ans)); return ans; } } math; // .div.mul : div[i]、mul[i]はそれぞれiの約数、倍数を格納している。 // .div_init(n) : div,mulを初期化。引数はnまで。n < 1e6 ~ 1e7。 // .divisor(x) : xの約数列挙。xは64bit整数。 // .sqrt(x) : floor(sqrt(x))。xは64bit整数。誤差は発生しない。 // .logx(x , a) : floor(loga(x))。xは64bit整数。誤差は発生しない。 // .pow(x , a) : x^a。誤差は発生しない。戻り値がオーバフローした場合は不定値-1が返る。 // .base(x , a) : x(10進数)をa進数表記に。1 <= a <= 10。戻り値はll型。 // .baseS(x , a) : x(10進数)をa進数表記に。1 <= a <= 10。戻り値はstring型。 int main(){ ll k; cin>>k; vl cnt(19); cnt[0] = 1; map mp; mp[0] = 1; mp[4] = 1; mp[6] = 1; mp[9] = 1; mp[8] = 2; vl f(19); f[0] = 1; rep1(i,19) f[i] = f[i-1] * 10; rep1(i,19){ rep(j,i){ if (j != 0) cnt[i] += cnt[j] * 9; if (j != 0) cnt[i] += mp[0] * (i - j - 1) * (math.pow(10 , j) - math.pow(10 , j-1)) * 9; else cnt[i] += mp[0] * (i - j - 1) * 9; } cnt[i] += math.pow(10 , i-1)*5; } auto output = [&](ll x) -> ll{ ll ret = 0; string s = to_string(x); int l = sz(s); rep1(i,l) ret += cnt[i]; rep(i,l){ int a = s[i] - '0'; if (i == l-1){ rep(j,a+1){ if (l == 1 && j == 0) continue; if (mp.count(j)) ret += mp[j]; } continue; } if (mp.count(a)){ string t = s.substr(i+1 , l - i - 1); ll tmp = stol(t); ret += mp[a] * (tmp+1); } rep(j,a){ if (i == 0 && j == 0) continue; rep(ii , l-i){ if (ii != l-i-1) ret += cnt[l - i - 1 - ii]; if (ii != l-i-1) ret += mp[0] * ii * (math.pow(10 , l - i - 1 - ii) - math.pow(10 , l - i - 1 - ii-1)); else ret += mp[0] * ii * math.pow(10 , l - i - 1 - ii); } if (mp.count(j)){ ret += mp[j] * math.pow(10 , l - i - 1); } } } return ret; }; ll sum2 = 0; // rep1(i,10000000){ // string s = to_string(i); // fore(y , s) if (mp.count(y - '0')) sum2 += mp[y - '0']; // if (output(i) != sum2){ // show(i); // deb(output(i) , sum2); // break; // } // } ll l = 0 , u = (ll)1e18+1; while(u - l > 1){ ll mid = (l + u) / 2; ll tmp = output(mid); if (tmp <= k) l = mid; else u = mid; } ll tmp = output(l); if (tmp != k){ cout << -1 << endl; }else{ cout << l << endl; } return 0; }