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>).
def gcd(a, b):
    while a != 0 and b != 0:
        if a > b:
            a = a % b
        else:
            b = b % a
 
    return a + b
a, b = map(int, input().split())
A = a // gcd(a, b)
B = b // gcd(a, b)
cnt = 0
while A % 5 == 0:
    A = A // 5
    cnt += 1
while A % 3 == 0:
    A = A // 3
    cnt += 1
while A % 2 == 0:
    A = A // 2
    cnt += 1
while B % 5 == 0:
    B = B // 5
    cnt += 1
while B % 3 == 0:
    B = B // 3
    cnt += 1
while B % 2 == 0:
    B = B // 2
    cnt += 1
if B == 1 and A == 1:
    print(cnt)
else:
    print(-1)