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.

Input

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

Output

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.

Examples

Input

5071


Output

4


Input

705


Output

1


Input

1241367


Output

-1

Note

In the first example one of the possible sequences of moves is 5071 → 5701 → 7501 → 7510 → 7150.
import java.util.*;


import java.io.*;
import java.lang.*;
import java.lang.reflect.Array;
import java.math.*;

public class Test5
{
	static class pair
	 {
		Integer x;
		String y;
		pair(int x,String y)
		{
			this.x=x;
			this.y=y;
		}
//		public int compareTo(pair o)
//		{
//			if(x<o.x)
//				return -1;
//			else
//				return 1;
//		}  
	}
	static int ans=0;
	static long mod=1000000007;
	static boolean prime[];
	
	public static void main(String args[])
	{
		InputReader in=new InputReader(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		long l = in.nextLong();
		String str = Long.toString(l);
		char[] ch = new char[str.length()];
		for(int i=0;i<str.length();i++)
			ch[i]=str.charAt(i);
		int min = 1000000;
		int count = 0;
//		count = zerozero(ch);
//		if(count!=-1)
//			min = Math.min(count, min);
//		count = twofive(ch);
//		if(count!=-1)
//			min = Math.min(count, min);
//		count = fivezero(ch);
//		if(count!=-1)
//			min = Math.min(min, count);
//		count = sevenfive(ch);
//		if(count!=-1)
//			min = Math.min(min, count);
		count = func(ch , '0' , '0');
		if(count!=-1)
			min = Math.min(count, min);
		count = func(ch, '5', '2');
		if(count!=-1)
			min = Math.min(count, min);
		count = func(ch, '0', '5');
		if(count!=-1)
			min = Math.min(min, count);
		count = func(ch , '5', '7');
		if(count!=-1)
			min = Math.min(min, count);
		if(min!=1000000)
			pw.println(min);
		else
			pw.println("-1");
		pw.flush();
	}
	public static int func(char[] ch, char c1, char c2) {
		char[] chh = new char[ch.length];
		for(int i=0;i<ch.length;i++)
			chh[i] = ch[i];
		boolean first = false,second = false;
		int count=0;
		for(int i=ch.length-1;i>=0;i--) {
			if(chh[i]==c1) {
				for(int j=i+1;j<ch.length;j++) {
					chh[j-1] = chh[j];
					count++;
				}
				chh[ch.length-1] = c1;
				first = true;
				break;
			}
		}
		if(!first)
			return -1;
		for(int i=ch.length-2;i>=0;i--) {
			if(chh[i]==c2) {
				for(int j=i+1;j<ch.length-1;j++) {
					chh[j-1] = chh[j];
					count++;
				}
				chh[ch.length-2] = c2;
				second = true;
				break;
			}
		}
		if(!second)
			return -1;
		int c = firstnonzero(chh);
		if(ch.length>2 && c > ch.length-3)
			return -1;
		count += c;
		return count;
	}
//	public static int zerozero(char[] ch) {
//		char[] chh = new char[ch.length];
//		for(int i=0;i<ch.length;i++)
//			chh[i] = ch[i];
//		boolean fzero = false,szero = false;
//		int count=0;
//		for(int i=ch.length-1;i>=0;i--) {
//			if(chh[i]=='0') {
//				for(int j=i+1;j<ch.length;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-1] = '0';
//				fzero = true;
//				break;
//			}
//		}
//		if(!fzero)
//			return -1;
//		for(int i=ch.length-2;i>=0;i--) {
//			if(chh[i]=='0') {
//				for(int j=i+1;j<ch.length-1;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-2] = '0';
//				szero = true;
//				break;
//			}
//		}
//		if(!szero)
//			return -1;
//		int c = firstnonzero(chh);
//		if(ch.length>2 && c > ch.length-3)
//			return -1;
//		count += c;
//		return count;
//	}
//	public static int twofive(char[] ch) {
//		char[] chh = new char[ch.length];
//		for(int i=0;i<ch.length;i++)
//			chh[i] = ch[i];
//		boolean two = false,five = false;
//		int count=0;
//		for(int i=ch.length-1;i>=0;i--) {
//			if(chh[i]=='5') {
//				for(int j=i+1;j<ch.length;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-1] = '5';
//				five = true;
//				break;
//			}
//		}
//		if(!five)
//			return -1;
//		for(int i=ch.length-2;i>=0;i--) {
//			if(chh[i]=='2') {
//				for(int j=i+1;j<ch.length-1;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-2] = '2';
//				two = true;
//				break;
//			}
//		}
//		if(!two)
//			return -1;
//		int c = firstnonzero(chh);
//		if(ch.length>2 && c > ch.length-3)
//			return -1;
//		count += c;
//		return count;
//	}
//	public static int fivezero(char[] ch) {
//		char[] chh = new char[ch.length];
//		for(int i=0;i<ch.length;i++)
//			chh[i] = ch[i];
//		boolean five = false,zero = false;
//		int count=0;
//		for(int i=ch.length-1;i>=0;i--) {
//			if(chh[i]=='0') {
//				for(int j=i+1;j<ch.length;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-1] = '0';
//				zero = true;
//				break;
//			}
//		}
//		if(!zero)
//			return -1;
//		for(int i=ch.length-2;i>=0;i--) {
//			if(chh[i]=='5') {
//				for(int j=i+1;j<ch.length-1;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-2] = '5';
//				five = true;
//				break;
//			}
//		}
//		if(!five)
//			return -1;
//		int c = firstnonzero(chh);
//		if(ch.length>2 && c > ch.length-3)
//			return -1;
//		count += c;
//		return count;
//	}
//	public static int sevenfive(char[] ch) {
//		char[] chh = new char[ch.length];
//		for(int i=0;i<ch.length;i++)
//			chh[i] = ch[i];
//		boolean seven = false,five = false;
//		int count=0;
//		for(int i=ch.length-1;i>=0;i--) {
//			if(chh[i]=='5') {
//				for(int j=i+1;j<ch.length;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-1] = '5';
//				five = true;
//				break;
//			}
//		}
//		if(!five)
//			return -1;
//		for(int i=ch.length-2;i>=0;i--) {
//			if(chh[i]=='7') {
//				for(int j=i+1;j<ch.length-1;j++) {
//					chh[j-1] = chh[j];
//					count++;
//				}
//				chh[ch.length-2] = '7';
//				seven = true;
//				break;
//			}
//		}
//		if(!seven)
//			return -1;
//		int c = firstnonzero(chh);
//		if(ch.length>2 && c > ch.length-3)
//			return -1;
//		count += c;
//		return count;
//	}
	public static int firstnonzero(char[] ch) {
		for(int i=0;i<ch.length;i++)
			if(ch[i]!='0')
				return i;
		return -1;
	}
	public static int distance(int x,int y,int p,int q)
	{
		int a=(x-p)*(x-p);
		int b=(y-q)*(y-q);
		int dis=a+b;
		return dis;
	}
	public static int bnum(int num)
	{
		int ans=0;
		for(int i=31;i>=0;i--)
		{
			if((num&(1<<i))!=0)
			{
				ans+=Math.pow(10,i);
			}
		}
		return ans;
	}
	public static int bsdown(int a[],int item)
	{
		int low=0,high=a.length-1,ans=-1;
		while(low<=high)
		{
			int mid=low+(high-low)/2;
			if(a[mid]<=item)
			{
				ans=mid;
				low=mid+1;
			}
			else
				high=mid-1;
				
		}
		return ans;
	}
	public static long inverse(long num)
	{
		return fastpow(num,mod-2,mod);
	}
	public static int bsupper(int a[],int item)
	{
		int low=0,high=a.length-1,ans=-1;
		while(low<=high)
		{
			int mid=low+(high-low)/2;
			if(a[mid]>=item)
			{
				ans=mid;
				high=mid-1;
			}
			else
				low=mid+1;
				
		}
		return ans;
	}	
	public static boolean isprime(int n)
	{
		for(int i=2;i*i<=n;i++)
		{
			if(n%i==0)
				return false;
		}
		return true;
	}
	public static long fact(long a,long mod)
	{
		long ans=1;
		for(int i=1;i<=a;i++)
		{
			ans*=i;
			ans%=mod;
		}
		return ans%mod;
		
	}
	public static long ncr(long n,long r,long mod)
	{
		long nom=1,dom=1;
		nom=(fact(n,mod))%mod;
		dom=(fact(r,mod)*fact(n-r,mod))%mod;
		return (nom*fastpow(dom,mod-2,mod))%mod;
	}
	public static long gcd(long x, long y)
	{
		if(x==0)
			return y;
		if(y==0)
			return x;
		long r=0, a, b;
		a = (x > y) ? x : y; // a is greater number
		b = (x < y) ? x : y; // b is smaller number
		r = b;
		while(a % b != 0)
		{
			r = a % b;
			a = b;
			b = r;
		}
		return r;
	}
	public static void prime(int n)
	{
		prime[0]=true;
		prime[1]=true;
		for(int i=2;i*i<=n;i++)
		{
			if(prime[i])
				continue;
			for(int j=i;j*i<=n;j++)
			{
				prime[i*j]=true;
			}
		}
	}
	static class InputReader 
	{
		 
		private final InputStream stream;
		private final byte[] buf = new byte[8192];
		private int curChar, snumChars;
		private SpaceCharFilter filter;

		public InputReader(InputStream stream) 
		{
			this.stream = stream;
		}

		public int snext() 
		{
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) 
			{
				curChar = 0;
				try 
				{
					snumChars = stream.read(buf);
				}
				catch (IOException e) 
				{
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public int nextInt()
		{
			int c = snext();
			while (isSpaceChar(c))
			{
				c = snext();
			}
			int sgn = 1;
			if (c == '-')
			{
				sgn = -1;
				c = snext();
			}
			int res = 0;
			do
			{
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			}
			while (!isSpaceChar(c));
			return res * sgn;
		}

		public long nextLong() 
		{
			int c = snext();
			while (isSpaceChar(c)) 
			{
				c = snext();
			}
			int sgn = 1;
			if (c == '-') 
			{
				sgn = -1;
				c = snext();
			}
			long res = 0;
			do
			{
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			}
			while (!isSpaceChar(c));
			return res * sgn;
		}

		public int[] nextIntArray(int n) 
		{
			int a[] = new int[n];
			for (int i = 0; i < n; i++) 
			{
				a[i] = nextInt();
			}
			return a;
		}

		public String readString() 
		{
			int c = snext();
			while (isSpaceChar(c)) 
			{
				c = snext();
			}
			StringBuilder res = new StringBuilder();
			do
			{
				res.appendCodePoint(c);
				c = snext();
			}
			while (!isSpaceChar(c));
			return res.toString();
		}

		public String nextLine()
		{
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do 
			{
				res.appendCodePoint(c);
				c = snext();
			}
			while (!isEndOfLine(c));
			return res.toString();
		}

		public boolean isSpaceChar(int c) 
		{
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		private boolean isEndOfLine(int c) 
		{
			return c == '\n' || c == '\r' || c == -1;
		}

		public interface SpaceCharFilter 
		{
			public boolean isSpaceChar(int ch);
		}
	}
	public static long fastpow(long a,long b,long mod)
	{
		long ans=1;
		while(b!=0)
		{
			if(b%2==1)
			{
				ans=(ans*a)%mod;
			}
			a=(a*a)%mod;
			b/=2;
		}
		return ans;
	}
}