In this Kata, you will be given a number and your task will be to rearrange the number so that it is divisible by `25`, but without leading zeros. Return the minimum number of digit moves that are needed to make this possible. If impossible, return `-1` ( `Nothing` in Haskell ).

For example:

More examples in test cases.

Good luck!

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import re\ndef solve(n):\n    print(n)\n    min_moves=[]\n    n=str(n)\n    l=len(n)-1\n    extra=0\n    \n    if \'2\' in n and \'5\' in n:\n        print(\'25\')\n        temp=list(n)\n        if n.rindex(\'2\') > n.rindex(\'5\'):\n            extra=1\n        temp[n.rindex(\'2\')]=\'\'\n        temp[n.rindex(\'5\')]=\'\'\n        #temp=re.sub(\' \',\'\',temp)\n        temp=\'\'.join(temp)\n        if temp and temp[0]==\'0\':\n                x = re.search("[1-9]", temp)\n                if x:\n                    extra+=x.start()\n        min_moves.append(l-1-n.rindex(\'2\')+l-n.rindex(\'5\')+extra)\n        extra=0\n         \n    if \'7\' in n and \'5\' in n:\n        print(\'75\')\n        temp=list(n)\n        if n.rindex(\'7\') > n.rindex(\'5\'):\n            extra=1\n        temp[n.rindex(\'7\')]=\'\'\n        temp[n.rindex(\'5\')]=\'\'\n        #temp=re.sub(\' \',\'\',temp)\n        temp=\'\'.join(temp)\n        print(\'temp\',temp)\n        if temp and temp[0]==\'0\':\n                x = re.search("[1-9]", temp)\n                if x:\n                    extra+=x.start()\n                    print(\'extra\',extra)\n        min_moves.append(l-1-n.rindex(\'7\')+l-n.rindex(\'5\')+extra)\n        extra=0\n    if \'5\' in n and \'0\' in n:\n        print(\'50\')\n        if n.rindex(\'5\') > n.rindex(\'0\'):\n            extra=1\n        \n        min_moves.append(l-1-n.rindex(\'5\')+l-n.rindex(\'0\')+extra)\n        extra=0\n    if n.count(\'0\')>1:\n        print(\'00\')\n        min_moves.append(l-1-n.rindex(\'0\')+l-n.rindex(\'0\',0,n.rindex(\'0\')))\n    print(min_moves)\n    if not min_moves:\n        return -1\n    return min(min_moves)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'solve'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 7751