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>).
"""A - Position in Fraction"""

def pieces(a, b):
    div = [2, 3, 5]
    op = 0
    if a >= 1 and b <= 1E+10:
        if a == b:
            return op
        if a < b:
            for i in div:
                if a == i:
                    op -= 1
                if a % i == 0:
                    a = a // i
                    op += 1
                    if a == b:
                        return op
                    for j in div:
                        if b == j:
                            op -= 1
                        if b % j == 0:
                            b = b // j
                            op += 1
                        if a == b:
                            return op
            return -1
        elif a > b:
            for i in div:
                if b == i:
                    op -= 1
                if b % i == 0:
                    b = b // i
                    op += 1
                    if b == a:
                        return op
                    for j in div:
                        if a == j:
                            op -= 1
                        if a % j == 0:
                            a = a // j
                            op += 1
                        if b == a:
                            return op
            return -1
    else:
        return "Error"


print(pieces(12, 18))