#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9 + 7;
int main() {
  string s;
  cin >> s;
  int n = s.length();
  reverse(begin(s), end(s));
  int ans = INF;
  for (string pat : {"00", "25", "50", "75"}) {
    reverse(begin(pat), end(pat));
    [&]() {
      string t = s;
      int cnt = 0;
      for (int i : {0, 1}) {
        int p = i;
        while (p < n && t[p] != pat[i]) p++;
        if (p == n) return;
        for (int j = p; j >= i + 1; j--) swap(t[j], t[j - 1]), cnt++;
      }
      reverse(begin(t), end(t));
      if (t[0] == '0') {
        int p = 0;
        while (p < n && t[p] == '0')
          if (++p == n - 2) return;
        for (int j = p; j >= 1; j--) swap(t[j], t[j - 1]), cnt++;
      }
      ans = min(ans, cnt);
    }();
  }
  if (ans == INF) ans = -1;
  cout << ans << endl;
  return 0;
}
