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 = "def solve(n):\n    sn = str(n)\n    ret = 0\n    if n % 25 == 0:\n        return ret\n    \n    if not (sn.count('0') >= 2 or ('5' in sn and ('0' in sn or '2' in sn or '7' in sn))):\n        return -1\n\n    zeroes = []\n    two = -1\n    five = -1\n    seven = -1\n    for c in range(len(sn)):\n        if sn[c] == '0':\n            zeroes.append(c)\n        elif sn[c] == '2':\n            two = c\n        elif sn[c] == '5':\n            five = c\n        elif sn[c] == '7':\n            seven = c\n            \n    minlen = 2 * len(sn)\n    if len(zeroes) > 1:\n        # '00' possible\n        # move last 0 to last place\n        steps = len(sn) - zeroes[-1] - 1\n        # move second to last 0 to last place but 1\n        steps += len(sn) - zeroes[-2] - 2\n        minlen = min(minlen, steps)\n    \n    if five != -1:\n        # 25\n        if two != -1:\n            steps = 2*len(sn) - five - two - 3\n            if five < two:\n                steps += 1\n            # check for leading zeroes\n            min25 = min(two,five)\n            max25 = max(two,five)\n            popsn = sn[:min25] + sn[min25+1:max25] + sn[max25+1:]\n            update = False\n            while len(popsn) > 0 and popsn[0] == '0':\n                steps += 1\n                update = True\n                popsn = popsn[1:]\n            minlen = min(minlen, steps)\n        # 50\n        if zeroes != []:\n            steps = 2*len(sn) - five - zeroes[-1] - 3\n            if zeroes[-1] < five:\n                steps += 1\n            # check for leading zeroes\n            min50 = min(zeroes[-1],five)\n            max50 = max(zeroes[-1],five)\n            popsn = sn[:min50] + sn[min50+1:max50] + sn[max50+1:]\n            update = False\n            while len(popsn) > 0 and popsn[0] == '0':\n                steps += 1\n                update = True\n                popsn = popsn[1:]\n            minlen = min(minlen, steps)\n        # 75\n        if seven != -1:\n            steps = 2*len(sn) - five - seven - 3\n            if five < seven:\n                steps += 1\n            # check for leading zeroes\n            min75 = min(five,seven)\n            max75 = max(five,seven)\n            popsn = sn[:min75] + sn[min75+1:max75] + sn[max75+1:]\n            update = False\n            while len(popsn) > 0 and popsn[0] == '0':\n                steps += 1\n                update = True\n                popsn = popsn[1:]\n            minlen = min(minlen, steps)\n    return minlen\n"
_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: 7190