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>).
cur_a, cur_b = [int(x) for x in input().split()]
steps = 0


a_amount_by_5 = 0
b_amount_by_5 = 0

next_a = cur_a
next_b = cur_b

while next_a % 5 == 0:
    next_a //= 5
    a_amount_by_5 += 1

while next_b % 5 == 0:
    next_b //= 5
    b_amount_by_5 += 1


a_amount_by_3 = 0
b_amount_by_3 = 0

next_a = cur_a
next_b = cur_b

while next_a % 3 == 0:
    next_a //= 3
    a_amount_by_3 += 1

while next_b % 3 == 0:
    next_b //= 3
    b_amount_by_3 += 1


a_amount_by_2 = 0
b_amount_by_2 = 0

next_a = cur_a
next_b = cur_b

while next_a % 2 == 0:
    next_a //= 2
    a_amount_by_2 += 1

while next_b % 2 == 0:
    next_b //= 2
    b_amount_by_2 += 1


total_steps = abs(a_amount_by_5 - b_amount_by_5) + abs(a_amount_by_3 - b_amount_by_3) + abs(a_amount_by_2 - b_amount_by_2)

cur_a //= (2** abs(a_amount_by_2 - b_amount_by_2))
cur_b //= (2** abs(a_amount_by_2 - b_amount_by_2))

cur_a //= (3** abs(a_amount_by_3 - b_amount_by_3))
cur_b //= (3** abs(a_amount_by_3 - b_amount_by_3))

cur_a //= (5** abs(a_amount_by_5 - b_amount_by_5))
cur_b //= (5** abs(a_amount_by_5 - b_amount_by_5))

if cur_a == cur_b:
    print(total_steps)
else:
    print(-1)
