human
Minimum steps to reach N from 1 by multiplying each step by 2 , 3 , 4 or 5 | Function to find a minimum number of steps to reach N from 1.
Check until N is greater than 1 and operations can be applied.
Condition to choose the operations greedily.
Driver code"
How can the above be solved in Python?

=====
Give me a code to minimum steps to reach N from 1 by multiplying each step by 2 , 3 , 4 or 5 and the other steps required?
assistant
#Here is code to minimum steps to reach N from 1 by multiplying each step by 2 , 3 , 4 or 5 and the other steps required.
 def Minsteps ( n ) :
	ans = 0
	while ( n > 1 ) :
		if ( n % 5 == 0 ) :
			ans = ans + 1
			n = n / 5
			continue
		elif ( n % 4 == 0 ) :
			ans = ans + 1
			n = n / 4
			continue
		elif ( n % 3 == 0 ) :
			ans = ans + 1
			n = n / 3
			continue
		elif ( n % 2 == 0 ) :
			ans = ans + 1
			n = n / 2
			continue
		return - 1
	return ans
n = 10
print ( Minsteps ( n ) )