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>).
m,n=map(int,input().split())
a=[0]*3
b=[0]*3
while m%2==0 or m%3==0 or m%5==0:
    if m%2==0:
        a[0]+=1
        m=m/2
    elif m%3==0:
        a[1]+=1
        m=m/3
    elif m%5==0:
        a[2]+=1
        m=m/5
while n%2==0 or n%3==0 or n%5==0:
    if n%2==0:
        b[0]+=1
        n=n/2
    elif n%3==0:
        b[1]+=1
        n=n/3
    elif n%5==0:
        b[2]+=1
        n=n/5
if m!=n: print(-1)
else:
    print(abs(a[0]-b[0])+abs(a[1]-b[1])+abs(a[2]-b[2]))
    


