#include <bits/stdc++.h>
using namespace std;

#define st first
#define nd second
#define pb push_back
using ll = long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

void solve(){
    ll n; cin >> n;
    if(n == 1){
        cout << 0 << "\n";
        return;
    }
    vector<ll> facts;
    ll cur = 1;
    ll last = 1;
    while(cur <= n){
        facts.pb(cur);
        cur *= last;
        last += 1;
        if(last == 11) break;
    }
    vector<int> ans;
    while(n > 0){
        ll best = 0;
        int id = 0;
        for(int i=0;i<facts.size();i++){
            if(facts[i] <= n){
                id = i;
                best = facts[i];
            }
        }
        n -= best;
        if(id == 1) id = 0;
        ans.pb(id);
    }
    bool was = false;
    bool bylo = false;
    for(int x : ans){
        if(x == 0){
            was = true;
            bylo = true;
        }
    }
    vector<int> odp;
    if(was){
        odp.pb(1);
        was = false;
    }
    sort(ans.begin(), ans.end());
    for(int x : ans){
        if(x == 0 && bylo){
            bylo = false;
            continue;
        }
        odp.pb(x);
    }
    for(int x : odp) cout << x;
    cout << "\n";
}

int main() {
    solve();
    return 0;
}