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 heapq
from collections import *
import math
def solve():

    a, b = map(int, input().split())
    t1, h1, f1, t2, h2, f2 = 0,0,0,0,0,0
    while a%2==0:
        t1+=1
        a//=2
    while b%2==0:
        t2+=1
        b//=2
    for i in range(3, int(math.sqrt(a))+1, 2):

        while a%i == 0:
            if i == 3:
                h1+=1
            elif i == 5:
                f1+=1
            a//=i
    for i in range(3, int(math.sqrt(b)) + 1, 2):

        while b % i == 0:
            if i == 3:
                h2 += 1
            elif i == 5:
                f2 += 1
            b //= i
    if a == b:
        print(abs(t1-t2) + abs(h1-h2) + abs(f1-f2))
    else:
        print(-1)

# t = int(input())
# for _ in range(t):
#     solve()
solve()
