#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#define int long long

using namespace std;

const int kmax = 5005;
const int kmaxM = 2e6 + 3;

long long g[6][kmaxM];
long long m, a[kmax], f[2][kmax][2];
long long res = 1e18;
long long pw[11];
long long o[6] = {0, 1, 11, 111, 1111, 11111};
string str;
long long lst, n;

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  for(int i = 0; i < 6; i++) {
    for(int j = 0; j < kmaxM; j++) {
      g[i][j] = 1e18;
    }
  }
  g[0][1000000] = 0;
  pw[0] = 1;
  for(int i = 1; i <= 10; i++) pw[i] = pw[i - 1] * 10;
  for(int i = 1; i < 6; i++) {
    for(int j = -1000000; j <= 1000000; j++) {
      if(g[i - 1][j + 1000000] != 1e18) {
        for(int k = -10; k <= 10; k++) {
          int v = j + k * o[i];
          if(-1000000 <= v && v <= 1000000) {
            g[i][v + 1000000] = min(g[i][v + 1000000], g[i - 1][j + 1000000] + i * abs(k));
          }
        }
      }
    }
  }
  while(cin >> str) {
    m = str.size() - 1;
    a[m + 1] = a[m + 2] = lst = n = 0;
    for(int i = 0; i <= m; i++) a[i] = str[m - i] - '0';
    for(int i = 0; i <= m; i++) {
      long long x = a[i] * 9 + lst;
      a[i] = x % 10, lst = x / 10;
      if(lst) m = max(m, i + 1);
    }
    if(m < 5) {
      long long n = 0;
      for(int i = 0; i <= m; i++) n += a[i] * pw[i];
      cout << g[5][n / 9 + 1000000] << '\n';
    } else {
      for(int i = 0; i < 2; i++) for(int j = 0; j <= m + 1; j++) for(int k = 0; k < 2; k++) f[i][j][k] = 1e18;
      f[(m + 1) & 1][0][0] = 0, f[(m + 1) & 1][0][1] = m + 1;
      for(int i = m; i >= 6; i--) {
        for(int j = 0; j <= m + 1; j++) {
          for(int k = 0; k < 2; k++) {
            f[i & 1][j][k] = 1e18;
          }
        }
        for(int j = 0; j <= m + 1; j++) {
          for(int k = 0; k < 2; k++) {
            if(f[(i & 1) ^ 1][j][k] == 1e18) continue;
            f[i & 1][j + k][0] = min(f[i & 1][j + k][0], f[(i & 1) ^ 1][j][k] + 1ll * i * abs(a[i] - 10ll * k));
            f[i & 1][j + k][1] = min(f[i & 1][j + k][1], f[(i & 1) ^ 1][j][k] + 1ll * i * abs(a[i] - 10ll * k + 1));
          }
        }
      }
      for(int i = 0; i < 6; i++) n += a[i] * pw[i];
      for(int i = 6; i <= m; i++) n += a[i];
      res = 1e18;
      for(int i = 0; i <= m + 1; i++) {
        for(int j = 0; j < 2; j++) {
          res = min(res, f[0][i][j] + g[5][(n - j * 999999 - i * 9) / 9 + 1000000]);
        }
      }
      cout << res << '\n';
    }
  }
  return 0;
}