#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 7;
const long long mod = 1e9 + 7;
const long long INF = 1e18 + 1;
void solve() {
  string s;
  cin >> s;
  long long n = ((int)(s).size());
  long long ans = INF;
  string req[7] = {"00", "25", "50", "75", "52", "05", "57"};
  for (long long i = 0; i < 7; i++) {
    long long k1 = -1, k2 = -1;
    for (int j = n - 1; j >= 0; j--) {
      if (s[j] == req[i][1]) {
        k2 = j;
        for (int k = j - 1; k >= 0; k--) {
          if (s[k] == req[i][0]) {
            k1 = k;
            long long f = 1;
            long long cnt = (n - k1 - 2) + (n - k2 - 1);
            if ((k1 == 0 and s[1] == '0' and k2 != 1) or
                (n >= 3 and k1 == 0 and k2 == 1 and s[2] == 0)) {
              f = -1;
              for (long long kk = 2; kk < n; kk++) {
                if (s[kk] != '0' and kk != k1 and kk != k2) {
                  f = 1;
                  cnt += kk;
                  if (kk > k1) cnt--;
                  if (kk > k2) cnt--;
                  break;
                }
              }
            }
            if (f == -1) break;
            string temp = "";
            temp += s[k1];
            temp += s[k2];
            if (temp == "52" or temp == "05" or temp == "57") cnt++;
            ans = min(ans, cnt);
          }
        }
      }
    }
  }
  cout << (ans == INF ? -1 : ans);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
}
