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.
The first line contains two space-separated integers *a* and *b* (1 ≤ *a*, *b* ≤ 10<sup class="upper-index">9</sup>).
import math

class PrimeFactorization:
    def __init__(self):
        self.qq = 0  
        self.q2 = 0  
        self.q3 = 0  
        self.q5 = 0  

def get_prime_factorization(n):
    factorization = PrimeFactorization()

    while n % 2 == 0:
        factorization.q2 += 1
        n //= 2
    while n % 3 == 0:
        factorization.q3 += 1
        n //= 3
    while n % 5 == 0:
        factorization.q5 += 1
        n //= 5
    factorization.qq = n
    return factorization

a, b = map(int, input().split())

factorization_a = get_prime_factorization(a)
factorization_b = get_prime_factorization(b)

if factorization_a.qq != factorization_b.qq:
    print("-1")  
else:
    distance = abs(factorization_a.q2 - factorization_b.q2) + \
               abs(factorization_a.q3 - factorization_b.q3) + \
               abs(factorization_a.q5 - factorization_b.q5)
    print(distance)
	 		 	  				  				 	     		 	