#include <bits/stdc++.h>
using namespace std;
const int MAXN = 26;
int a[MAXN];
int b[4][2] = {0, 0, 2, 5, 5, 0, 7, 5};
int main() {
  int n, ans;
  long long nn;
  cin >> nn;
  for (n = 0; nn > 0; nn /= 10) a[n++] = (int)(nn % 10);
  ans = INT_MAX;
  for (int i = 0; i < 4; ++i) {
    int pos[3], cur = 0;
    for (pos[1] = 0; pos[1] < n; ++pos[1])
      if (a[pos[1]] == b[i][1]) break;
    if (pos[1] == n) continue;
    for (pos[0] = 0; pos[0] < n; ++pos[0])
      if (pos[0] != pos[1] && a[pos[0]] == b[i][0]) break;
    if (pos[0] == n) continue;
    for (pos[2] = n - 1; pos[2] >= 0; --pos[2])
      if (pos[2] != pos[0] && pos[2] != pos[1] && a[pos[2]] != 0) break;
    if (pos[2] >= 0)
      cur += n - 1 - pos[2] - (pos[0] > pos[2]) - (pos[1] > pos[2]);
    cur += pos[1] + pos[0] - (pos[1] < pos[0]);
    ans = min(ans, cur);
  }
  if (ans == INT_MAX) ans = -1;
  cout << ans << endl;
  return 0;
}
