#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>

using namespace std;

int main()
{
    uint64_t Y;
    cin >> Y;
    vector<int> result;

    if (Y == 1)
    {
        cout << 0 << "\n";
        return 0;
    }

    vector<uint64_t> factorials;
    factorials.push_back(1);
    for (int i = 1; i < 10; i++)
    {
        factorials.push_back(i * factorials[i - 1]);
    }
    
    // int decimal_idx = 0;
    for (int i = 9; i > 0; i--)
    {
        while (Y >= factorials[i])
        {
            Y -= factorials[i];
            result.push_back(i);   // * pow(10, decimal_idx++);
        }
    }
    
    reverse(result.begin(), result.end());
    
    for(auto num : result)
    {
        cout << num;
    }
    cout << "\n";

    return 0;
}