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 sys

def solve(a: int, b: int) -> int:
    
    values = [a, b]
    times = {}
    for i, denominator in enumerate([2, 3, 5]):
        for j in range(2):
            
            while not values[j] % denominator:
                values[j] /= denominator
                times[(i, j)] = times.get((i, j), 0) + 1
         
    if values[0] != values[1]:
        return -1
    
    result = 0       
    for i in range(3):
        result = result + abs(times.get((i, 0), 0) - times.get((i, 1), 0))
        
    return result
    

# input
n, k = [int(x) for x in sys.stdin.readline().strip().split(" ")]
print(solve(n, k))
