#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
const int mod = 1e9 + 7;
char s[N];
int main() {
  cin >> s;
  int i, pos, t1, t2, t3;
  int len = strlen(s);
  int ans = 2 * len;
  t1 = -1, t2 = -1;
  pos = len;
  while (pos >= 0) {
    pos--;
    if (s[pos] == '0') {
      t1 = pos;
      break;
    }
  }
  while (pos >= 0) {
    pos--;
    if (s[pos] == '0') {
      t2 = pos;
      break;
    }
  }
  if (t1 != -1 && t2 != -1) {
    ans = min(ans, 2 * len - t1 - t2 - 3);
  }
  t1 = -1;
  t2 = -1;
  t3 = -1;
  pos = len - 1;
  while (pos >= 0) {
    if (s[pos] == '5') {
      t1 = pos;
      break;
    }
    pos--;
  }
  pos = len - 1;
  while (pos >= 0) {
    if (s[pos] == '2') {
      t2 = pos;
      break;
    }
    pos--;
  }
  if (t1 != -1 && t2 != -1) {
    if (s[1] == '0' && (t1 == 0 || t2 == 0)) {
      if (t1 == 0) {
        for (i = 2; i <= len - 1; i++) {
          if (s[i] != '0' && i != t2) {
            t3 = i;
            break;
          }
        }
        if (t3 != -1) {
          if (t3 < t2) ans = min(ans, 2 * len - t1 - t2 - 3 + t3);
          if (t3 > t2) ans = min(ans, 2 * len - t1 - t2 - 3 + t3 - 1);
        }
      }
      if (t2 == 0) {
        for (i = 2; i <= len - 1; i++) {
          if (s[i] != '0' && i != t1) {
            t3 = i;
            break;
          }
        }
        if (t3 != -1) {
          if (t3 < t1) ans = min(ans, 2 * len - t1 - t2 - 2 + t3 - 1);
          if (t3 > t1) ans = min(ans, 2 * len - t1 - t2 - 2 + t3 - 2);
        }
      }
    } else if (s[2] == '0' && t1 < 2 && t2 < 2) {
      for (i = 3; i <= len - 1; i++) {
        if (s[i] != '0') {
          t3 = i;
          break;
        }
      }
      if (t3 != -1) {
        if (t1 < t2) ans = min(ans, 2 * len - t1 - t2 - 2 + t3 - 1);
        if (t1 > t2) ans = min(ans, 2 * len - t1 - t2 - 3 + t3 - 2);
      }
    } else {
      if (t1 < t2) ans = min(ans, 2 * len - t1 - t2 - 2);
      if (t1 > t2) ans = min(ans, 2 * len - t1 - t2 - 3);
    }
  }
  t1 = -1, t2 = -1;
  t3 = -1;
  pos = len - 1;
  while (pos >= 0) {
    if (s[pos] == '0') {
      t1 = pos;
      break;
    }
    pos--;
  }
  pos = len - 1;
  while (pos >= 0) {
    if (s[pos] == '5') {
      t2 = pos;
      break;
    }
    pos--;
  }
  if (t1 != -1 && t2 != -1) {
    if (t2 == 0 && s[1] == '0' && t1 != 1) {
      for (i = 2; i <= len - 1; i++) {
        if (s[i] != '0') {
          t3 = i;
          break;
        }
      }
      if (t3 != -1) {
        if (t3 < t1) ans = min(ans, 2 * len - t1 - t2 - 3 + t3 - 1);
        if (t3 > t1) ans = min(ans, 2 * len - t1 - t2 - 3 + t3 - 2);
      }
    } else if (t2 == 0 && s[2] == '0' && t1 == 1) {
      for (i = 2; i <= len - 1; i++) {
        if (s[i] != '0') {
          t3 = i;
          break;
        }
      }
      if (t3 != -1) {
        ans = min(ans, 2 * len - t1 - t2 - 1 + t3 - 2);
      }
    } else {
      if (t2 > t1) ans = min(ans, 2 * len - t1 - t2 - 2);
      if (t2 < t1) ans = min(ans, 2 * len - t1 - t2 - 3);
    }
  }
  t1 = -1;
  t2 = -1;
  t3 = -1;
  pos = len - 1;
  while (pos >= 0) {
    if (s[pos] == '5') {
      t1 = pos;
      break;
    }
    pos--;
  }
  pos = len - 1;
  while (pos >= 0) {
    if (s[pos] == '7') {
      t2 = pos;
      break;
    }
    pos--;
  }
  if (t1 != -1 && t2 != -1) {
    if (s[1] == '0' && (t1 == 0 || t2 == 0)) {
      if (t1 == 0) {
        for (i = 2; i <= len - 1; i++) {
          if (s[i] != '0' && i != t2) {
            t3 = i;
            break;
          }
        }
        if (t3 != -1) {
          if (t3 < t2) ans = min(ans, 2 * len - t1 - t2 - 3 + t3);
          if (t3 > t2) ans = min(ans, 2 * len - t1 - t2 - 3 + t3 - 1);
        }
      }
      if (t2 == 0) {
        for (i = 2; i <= len - 1; i++) {
          if (s[i] != '0' && i != t1) {
            t3 = i;
            break;
          }
        }
        if (t3 != -1) {
          if (t3 < t1) ans = min(ans, 2 * len - t1 - t2 - 2 + t3 - 1);
          if (t3 > t1) ans = min(ans, 2 * len - t1 - t2 - 2 + t3 - 2);
        }
      }
    } else if (s[2] == '0' && t1 < 2 && t2 < 2) {
      for (i = 3; i <= len - 1; i++) {
        if (s[i] != '0') {
          t3 = i;
          break;
        }
      }
      if (t3 != -1) {
        if (t1 < t2) ans = min(ans, 2 * len - t1 - t2 - 2 + t3 - 1);
        if (t1 > t2) ans = min(ans, 2 * len - t1 - t2 - 3 + t3 - 2);
      }
    } else {
      if (t1 < t2) ans = min(ans, 2 * len - t1 - t2 - 2);
      if (t1 > t2) ans = min(ans, 2 * len - t1 - t2 - 3);
    }
  }
  if (ans == 2 * len) ans = -1;
  cout << ans;
  return 0;
}
