CF988E.Divisibility by 25

You are given an integer $n$ from $1$ to $10^{18}$ without leading zeroes.

In one move you can swap any two adjacent digits in the given number in such a way that the resulting number will not contain leading zeroes. In other words, after each move the number you have cannot contain any leading zeroes.

What is the minimum number of moves you have to make to obtain a number that is divisible by $25$? Print -1 if it is impossible to obtain a number that is divisible by $25$.

给你一个从 $1$ 到 $10^{18}$ 的整数 $n$，其十进制表示中不含前导零。

每次操作中，你可以交换该数中任意两个相邻的数字，但要求操作后得到的数不能含有前导零。换言之，每次操作后你所拥有的数均不得包含前导零。

你需要进行最少多少次操作，才能得到一个能被 $25$ 整除的数？如果不可能得到能被 $25$ 整除的数，请输出 $-1$。

The first line contains an integer $n$ ($1 \le n \le 10^{18}$). It is guaranteed that the first (left) digit of the number $n$ is not a zero.

第一行包含一个整数 $n$（$1 \le n \le 10^{18}$）。保证 $n$ 的首位（最左边）数字不为零。

If it is impossible to obtain a number that is divisible by $25$, print -1. Otherwise print the minimum number of moves required to obtain such number.

Note that you can swap only adjacent digits in the given number.

如果无法得到一个能被 $25$ 整除的数，则输出 $-1$；否则输出得到这样的数所需的最少操作次数。

注意：在给定的数字中，你只能交换相邻的两个数字。

In the first example one of the possible sequences of moves is 5071 $\rightarrow$ 5701 $\rightarrow$ 7501 $\rightarrow$ 7510 $\rightarrow$ 7150.

在第一个例子中，一种可能的移动序列为 5071 $\rightarrow$ 5701 $\rightarrow$ 7501 $\rightarrow$ 7510 $\rightarrow$ 7150。