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
a,b=map(int,input().split())
g=math.gcd(a,b)
q=0
c=[0,0,0]
r=0
while r==0:
    r=1
    if b%5==0:
        b//=5
        c[2]+=1
        r=0
    if b%3==0:
        b//=3
        c[1]+=1
        r=0
    if b%2==0:
        b//=2
        c[0]+=1
        r=0
r=0
c1=[0,0,0]
while r==0:
    r=1
    if a%5==0:
        a//=5
        c1[2]+=1
        r=0
    if a%3==0:
        a//=3
        c1[1]+=1
        r=0
    if a%2==0:
        a//=2
        c1[0]+=1
        r=0
if a!=b:
    print(-1)
else:
    print(abs(c1[0]-c[0])+abs(c1[1]-c[1])+abs(c1[2]-c[2]))