#include <bits/stdc++.h>

using namespace std;

#define int int64_t
#define ld long double
#define el '\n'
#define fi first
#define se second

#define once_more_into_the_fray ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int INF = 1e17;
const int N = 1e5 + 10;
const int A = 9;
int dp[1 << A];
int n, m;
string s;
int adj[A][A];

bool relax(int &a, int b) {
  if (a <= b) return false;
  a = b;
  return true;
}

void run_case(int tc) {
  cin >> s;
  n = int(s.size());
  m = 9;
  s[0]--;
  for (int i = 0; i < n - 1; i++) {
    s[i + 1]--;
    adj[s[i] - '0'][s[i + 1] - '0'] += 1;
    adj[s[i + 1] - '0'][s[i] - '0'] += 1;
  }
  for (auto &i: dp)
    i = INF;
  dp[0] = 0;
  for (int mask = 0; mask < 1 << A; mask++) {
    for (int nxt = 0; nxt < m; nxt++) {
      if (1 << nxt & mask) continue;
      int cont = 0;
      int pos = __builtin_popcount(mask);
      for (int c = 0; c < m; c++) {
        if (1 << c & mask)
          cont += pos * adj[nxt][c];
        else if (c != nxt)
          cont -= pos * adj[nxt][c];
      }
      relax(dp[mask | 1 << nxt], dp[mask] + cont);
    }
  }

  cout << dp[(1 << m) - 1] + n << el;
}

int32_t main() {
  once_more_into_the_fray        /*Turn Off for Interactive Problems*/

  int _t = 1;
  //cin >> _t;
  for (int i = 1; i <= _t; i++) {
    run_case(i);
  }
}