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
from collections import Counter


def primeFactors(n):
    l = []
    while n % 2 == 0:
        l.append(2),
        n = n / 2
    for i in range(3, int(math.sqrt(n))+1, 2):
        while n % i == 0:
            l.append(i)
            n = n / i
    if n > 2:
        l.append(n)
    return l


a, b = map(int, input().split())
temp = math.gcd(a, b)
ma = a//temp
mb = b//temp
xa = primeFactors(ma)
xb = primeFactors(mb)
c = 0
f = 1
for i in xa:
    c += 1
    if i not in [2, 3, 5]:
        f = 0
        break
for i in xb:
    c += 1
    if i not in [2, 3, 5]:
        f = 0
        break
if f == 1:
    print(c)
else:
    print(-1)
