#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <atcoder/modint>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)

const i64 INF = 1001001001001001001;

using modint = atcoder::static_modint<998244353>;

int circle_count_dig[10] = {1,0,0,0,1,0,1,0,2,1};

int circle_count_int(i64 x){
    int ans = 0;
    if(x == 0) ans = 1;
    while(x){
        ans += circle_count_dig[x%10];
        x /= 10;
    }
    return ans;
}

i64 circle_count_range(i64 r){
    if(r == 0) return 0;
    i64 t = r / 10;
    i64 ans = 0;
    for(i64 x = t*10; x < r; x++) ans += circle_count_int(x);
    if(t >= 1){
        ans += (circle_count_range(t) - 1) * 10;
        ans += t * 6;
    }
    return ans;
}

int main(){
    i64 K; cin >> K; K++;
    i64 l = 0, r = 100'000'000'000'000'000;
    while(l + 1 < r){
        i64 m = (l + r) / 2;
        if(circle_count_range(m) <= K) l = m; else r = m;
    }
    if(circle_count_range(l) == K){ cout << (l-1) << endl; } else cout << "-1\n";
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;