#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <tuple>
#include <iomanip>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const double eps = 1e-8;

inline ll calc(vector<int>& num, int len) {
    ll res = 0;
    for (int i = len-1; i >= 0; i--) {
	res = res * 10 + num[i];
    }
    return res;
}

ll solve(ll n) {
    ll m = n;
    int len, maxi = 0;
    vector<int> num;
    while (m > 0) {
	int v = m % 10;
	num.push_back(v);
	maxi = max(maxi, v);
	m /= 10;
    }
    len = num.size();
    if (len == 1) return n;
    int idx = len - 1;
    while (idx >= 0 && num[idx] == maxi) idx--;
    ll res;
    if (idx >= 1) {
	int index = -1;
	for (int i = 0; i <= idx; i++) {
	    if (num[i] == maxi) {
		index = i;
		break;
	    }
	}
	if (index >= 0) {
	    swap(num[idx], num[index]);
	    res = calc(num, len);
	} else {
	    res = 0;
	    ll t = 0;
	    for (int i = len-1; i >= 0; i--) {
		res = res * 10 + (i > idx ? num[i] : 0);
		if (i <= idx) t = t * 10 + num[i];
	    }
	    res += solve(t);
	}
    } else {
	res = calc(num, len);
    }

    return res;
}

int main() {
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    */

    ll n;
    scanf("%lld", &n);
    printf("%lld\n", solve(n));
}