human
Maximum prime moves to convert X to Y | Function to return the maximum operations required to convert X to Y.
X cannot be converted to Y.
If the difference is 1.
If the difference is even.
Add 3 to X and the new difference will be even.
Driver code"
How can the above be solved in Python?
 What is a code to maximum prime moves to convert X to Y and the other steps required?
assistant
#Here is code to maximum prime moves to convert X to Y and the other steps required.
 def maxOperations ( X , Y ) :
	if ( X > Y ) :
		return - 1 ;
	diff = Y - X ;
	if ( diff == 1 ) :
		return - 1 ;
	if ( diff % 2 == 0 ) :
		return ( diff // 2 ) ;
	return ( 1 + ( ( diff - 3 ) // 2 ) ) ;
if __name__ == " _ _ main _ _ " :
	X = 5 ; Y = 16 ;
	print ( maxOperations ( X , Y ) ) ;