#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e4 + 7;
long long expo(long long x, long long n, long long mod) {
  long long res = 1LL;
  while (n) {
    if (n & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    n = n / 2;
  }
  return res;
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int i, j;
  unsigned long long n;
  cin >> n;
  vector<int> v;
  if (n < 10) return cout << -1, 0;
  string s, str;
  s = to_string(n);
  int h[26] = {0};
  for (int i = (0); i < (int)((s).size()); i++) h[s[i] - '0']++;
  if ((h[0] < 2) && (h[0] == 0 || h[5] == 0) && (h[7] == 0 || h[5] == 0) &&
      (h[2] == 0 || h[5] == 0))
    return cout << -1 << ' ', 0;
  int c;
  if (h[0] > 0 && h[5] > 0) {
    str = s;
    c = 0;
    for (i = (int)((str).size()) - 1; i >= 0; i--)
      if (str[i] == '0') break;
    for (int j = (i); j < (int)((s).size()) - 1; j++)
      swap(str[j], str[j + 1]), c++;
    for (i = (int)((str).size()) - 2; i >= 0; i--)
      if (str[i] == '5') break;
    for (int j = (i); j < (int)((s).size()) - 2; j++)
      swap(str[j], str[j + 1]), c++;
    if (str[0] == '0') {
      i = 0;
      while (str[i] == '0' && i < (int)((str).size())) i++;
      for (j = i; j > 0; j--) swap(str[j], str[j - 1]), c++;
    }
    v.push_back(c);
  }
  if (h[0] > 1) {
    str = s;
    c = 0;
    for (i = (int)((str).size()) - 1; i >= 0; i--)
      if (str[i] == '0') break;
    for (int j = (i); j < (int)((s).size()) - 1; j++)
      swap(str[j], str[j + 1]), c++;
    for (i = (int)((str).size()) - 2; i >= 0; i--)
      if (str[i] == '0') break;
    for (int j = (i); j < (int)((s).size()) - 2; j++)
      swap(str[j], str[j + 1]), c++;
    if (str[0] == '0') {
      i = 0;
      while (str[i] == '0' && i < (int)((str).size())) i++;
      for (j = i; j > 0; j--) swap(str[j], str[j - 1]), c++;
    }
    v.push_back(c);
  }
  if (h[5] > 0 && h[7] > 0) {
    str = s;
    c = 0;
    for (i = (int)((str).size()) - 1; i >= 0; i--)
      if (str[i] == '5') break;
    for (int j = (i); j < (int)((s).size()) - 1; j++)
      swap(str[j], str[j + 1]), c++;
    for (i = (int)((str).size()) - 2; i >= 0; i--)
      if (str[i] == '7') break;
    for (int j = (i); j < (int)((s).size()) - 2; j++)
      swap(str[j], str[j + 1]), c++;
    if (str[0] == '0') {
      i = 0;
      while (str[i] == '0' && i < (int)((str).size())) i++;
      for (j = i; j > 0; j--) swap(str[j], str[j - 1]), c++;
    }
    v.push_back(c);
  }
  if (h[2] > 0 && h[5] > 0) {
    str = s;
    c = 0;
    for (i = (int)((str).size()) - 1; i >= 0; i--)
      if (str[i] == '5') break;
    for (int j = (i); j < (int)((s).size()) - 1; j++)
      swap(str[j], str[j + 1]), c++;
    for (i = (int)((str).size()) - 2; i >= 0; i--)
      if (str[i] == '2') break;
    for (int j = (i); j < (int)((s).size()) - 2; j++)
      swap(str[j], str[j + 1]), c++;
    if (str[0] == '0') {
      i = 0;
      while (str[i] == '0' && i < (int)((str).size())) i++;
      for (j = i; j > 0; j--) swap(str[j], str[j - 1]), c++;
    }
    v.push_back(c);
  }
  if (!v.empty()) {
    sort(v.begin(), v.end());
    cout << v[0];
  } else
    cout << 0;
  return 0;
}
