#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353ll;
const long long int P = 1000000007ll;
const long long int N = 400005ll;
long long int fun(long long int x, long long int y) {
  if (x % 25 == 0) return 0;
  vector<int> a, b;
  b.push_back(y % 10);
  y /= 10;
  b.push_back(y % 10);
  while (x) {
    a.push_back(x % 10);
    x /= 10;
  }
  long long int ans = 0;
  for (long long int i = (0); i <= (1); ++i) {
    int f = 1;
    for (int j = i; j < (long long int)a.size(); ++j) {
      if (a[j] == b[i]) {
        if (j == (long long int)a.size() - 1) {
          int k;
          for (k = (long long int)a.size() - 2; k >= 0 && a[k] == 0; --k)
            ;
          if (a[k]) {
            for (int k1 = k; k1 < (long long int)a.size() - 2; ++k1) {
              swap(a[k1], a[k1 + 1]);
              ++ans;
            }
          }
        }
        for (int k = j; k > i; --k) {
          swap(a[k], a[k - 1]);
          ++ans;
        }
        f = 0;
        break;
      }
    }
    if (f) return 1e18;
  }
  return ans;
}
void solve() {
  long long int n;
  cin >> n;
  if (n < 25) {
    cout << -1;
    return;
  }
  long long int mini = 1e18;
  for (long long int i = (1); i <= (4); ++i) mini = min(mini, fun(n, 25 * i));
  if (mini == 1e18)
    cout << -1;
  else
    cout << mini;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
