#include <bits/stdc++.h>

#define B 20
#define N 100001

using namespace std;

int f[N], n;
bitset<N> g[B];

void update(int &x, int y)
{
    if (y < x)
        x = y;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;

    f[1] = 1;
    f[2] = 2;
    g[1][1] = g[2][2] = true;

    int cur = 1;

    for (int i = 2; i <= n; i++)
    {
        for (int j = 0; j < B; j++)
        {
            if (g[j][i])
            {
                f[i] = j;
                break;
            }
        }

        for (int j = 10; j <= i; j *= 10)
            if (i % j >= j / 10)
                update(f[i], f[i % j] + f[i / j]);

        if (f[i] > cur)
        {
            cur = f[i];
            // cerr << "NEW F " << cur << " I " << i << '\n';
            // cerr.flush();
        }

        g[f[i]][i] = true;
        for (int j = 1; j <= cur && f[i] + j < B; j++)
            g[f[i] + j] |= g[j] << i;

        for (int j = 1; j <= i && i * j <= n; j++)
            if (f[i] + f[j] < B)
                g[f[i] + f[j]][i * j] = true;
    }

    cout << f[n] << '\n';
    return 0;
}