Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, correspondingly. The bears are so greedy that they are ready to fight for the larger piece. That's where the fox comes in and starts the dialog: "Little bears, wait a little, I want to make your pieces equal" "Come off it fox, how are you going to do that?", the curious bears asked. "It's easy", said the fox. "If the mass of a certain piece is divisible by two, then I can eat exactly a half of the piece. If the mass of a certain piece is divisible by three, then I can eat exactly two-thirds, and if the mass is divisible by five, then I can eat four-fifths. I'll eat a little here and there and make the pieces equal". 

The little bears realize that the fox's proposal contains a catch. But at the same time they realize that they can not make the two pieces equal themselves. So they agreed to her proposal, but on one condition: the fox should make the pieces equal as quickly as possible. Find the minimum number of operations the fox needs to make pieces equal.

Input

The first line contains two space-separated integers a and b (1 ≤ a, b ≤ 109). 

Output

If the fox is lying to the little bears and it is impossible to make the pieces equal, print -1. Otherwise, print the required minimum number of operations. If the pieces of the cheese are initially equal, the required number is 0.

Examples

Input

15 20


Output

3


Input

14 8


Output

-1


Input

6 6


Output

0
import java.util.*;
import java.io.*;
import java.math.*;
 
public class TaskA{

    public static void main(String[] args) throws FileNotFoundException{
    	InputStream inputStream = System.in;
    	OutputStream outputStream = System.out;
    	
    	InputReader in = new InputReader(inputStream);
    	OutputWriter out = new OutputWriter(outputStream);
    	
    	a = in.nextInt();
    	b = in.nextInt();
    	
    	
    	int ans=0;
    	ans = func(2)+func(3)+func(5);
    	
    	if(a==b) 
    		out.write(ans);
    	else
    		out.write(-1);
    
    	out.flush();
    	out.close();
    }
    
    static int a,b;
    
    static int func(int del){
    	int m1=0,m2=0;
    	
    	while(a%del==0){
    		a/=del;
    		m1++;
    	}
    	
    	while(b%del==0){
    		b/=del;
    		m2++;
    	}
    	
    	return Math.abs(m1-m2);
    }
    
    
    
    
}



class InputReader{
	
	private BufferedReader reader;
	private StringTokenizer tokenizer;
	
	public InputReader(InputStream stream){
		reader = new BufferedReader(new InputStreamReader(stream));
		tokenizer = null;
	}
	
	public String next(){
		while(tokenizer == null || !tokenizer.hasMoreTokens()){
			try{
				tokenizer = new StringTokenizer(reader.readLine());
			}catch(IOException e){
				throw new RuntimeException(e);
			}
		}
		
		return tokenizer.nextToken();
	}
	
	public String nextLine(){
		tokenizer = null;
		try{
			return reader.readLine();
		}catch(IOException e){
			throw new RuntimeException(e);
		}
		
}
	
	public int nextInt(){
		return Integer.parseInt(next());
	}
	
	public long nextLong(){
		return Long.parseLong(next());
	}
	
	public double nextDouble(){
		return Double.parseDouble(next());
	}
	
	public BigInteger nextBigInteger(){
		return new BigInteger(next());
	}
	
	public BigDecimal nextBigDecimal(){
		return new BigDecimal(next());
	}
	
	public int[] nextIntArray(int n){
		int[] rez = new int[n];
		for(int i=0; i<n; ++i)
			rez[i] = nextInt();
		
		return rez;
	
	}
}

        
class OutputWriter{
	private PrintWriter out;
	
	public OutputWriter(Writer out){
		this.out = new PrintWriter(out);
	}
	
	public OutputWriter(OutputStream out){
		this.out = new PrintWriter (new BufferedWriter(new OutputStreamWriter(out)));
	}
	
	public void write(Object ... o){
		for(Object x : o) out.print(x);
	}	
	
	public void writeln(Object ... o){
		write(o);
		out.println();
	}
	
	public void flush(){
		out.flush();
	}
	
	public void close(){
		out.close();
	}

}