#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll K;
    cin>>K;
    ll l=0,r=99193752409910740+10;
    vector<int> p={1,0,0,0,1,0,1,0,2,1};
    auto g=[&](ll X)->ll{
        ll ans=0;
        while(X) ans+=p[X%10],X/=10;
        return ans;
    };
    auto f=[&](auto self,ll X)->ll{
        if(X<=0) return 0;
        ll ans=0;
        ll Y=(X/10)*10ll;
        if(X>=10){
            ans=(X/10)*6ll-1;
        }
        while(Y<=X){
            ans+=g(Y);
            Y++;
        }
        return ans+self(self,X/10-1)*10ll;
    };
    while(r-l>1){
        ll med=(l+r)/2;
        if(f(f,med)>K) r=med;
        else l=med;
    }
    //cout<<l<<" "<<f(f,l)<<"\n";
    if(f(f,l)==K){
        cout<<l<<"\n";
    }else{
        cout<<"-1\n";
    }
    /*rep(i,20){
        cout<<i<<" "<<f(f,i)<<"\n";
    }*/
}