#include <iostream>
#include <vector>
#include <cmath>
#include <assert.h>

using namespace std;

int count(long long x) {
  int ret = 0;
  while (x) {
    ret += x % 5;
    if (x % 10 >= 5) ret++;
    x /= 10;
  }
  return ret;
}

int solve_naive(long long n) {
  int ans = 1e9;
  for (int x = n; x <= min<int>(n+1e7, n * 3); x++) {
    int cand = count(x) + count(x-n);
    if (cand < ans) {
      ans = cand;
    }
  }
  return ans;
}

int main() {
  long long n;
  cin >> n;
  cout << solve_naive(n) << endl;
  return 0;
}