#include <bits/stdc++.h>
using namespace std;
long long sol(string s, string s2) {
  long long ans = 0;
  if (s.length() < 2) return INT_MAX;
  for (long long j = 1; j >= 0; j--) {
    long long i = s.length();
    i -= 2 - j;
    while (i >= 0 && s[i] != s2[j]) i--;
    if (i < 0) return INT_MAX;
    for (long long k = i + 1; k < s.length() - 1 + j; k++) {
      swap(s[k - 1], s[k]);
      ans++;
    }
  }
  return ans;
}
long long solve(string s) {
  return min({sol(s, "00"), sol(s, "25"), sol(s, "50"), sol(s, "75")});
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  long long n = stoll(s);
  if (n < 25) {
    cout << -1;
    return 0;
  }
  if (n % 25 == 0) {
    cout << 0;
    return 0;
  }
  n %= 100;
  if (n == 5 || n == 57 || n == 52) {
    cout << 1;
    return 0;
  }
  long long ans = INT_MAX;
  for (long long i = 0; i < s.length(); i++) {
    if (s[i] == '0') continue;
    string tmp;
    for (long long j = 0; j < s.length(); j++) {
      if (j != i) tmp += s[j];
    }
    ans = min(ans, i + solve(tmp));
  }
  if (ans == INT_MAX) ans = -1;
  cout << ans;
}
