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,b = map(int,input().split())
import sys
if a == b:
    print(0)
    sys.exit(0)


# _a  = div(a)
# _b = div(b)

# store occurence of factors 2,3,5 of values a,b
c = [0]*3 # 2, 3, 5
d = [0]*3

while not (a % 2):
    a /= 2
    c[0] +=1
while not (a%3):
    a /= 3
    c[1] += 1
while not (a%5):
    a /=5
    c[2] += 1

while not (b%2): b /=2 ; d[0] += 1;
while not (b%3): b/=3; d[1] += 1;
while not (b%5): b/=5; d[2] += 1;

rv = 0
print(c,d)
# minimum is found by counting their gcd formed by 2,3,5
for _ in range(3):
    rv  += abs(c[_] - d[_])

print(rv)
sys.exit(0)
# return




			 	   		  		  	      		   	 	