human
Check if number can be made prime by deleting a single digit | Function to check if N is prime from builtins import range.
Corner cases.
This is checked so that we can skip middle five numbers in below loop.
Function to delete character at index i from given String str.
Deletes character at position 4.
Function to check if a number becomes prime by deleting any digit.
Converting the number to String.
length of String.
number should not be of single digit.
Loop to find all numbers after deleting a single digit.
Deleting ith character from the String.
converting String to int.
Driver Code"
How can the above be solved in Python?

=====
What is a code to check if number can be made prime by deleting a single digit and the other steps required?
assistant
#Here is code to check if number can be made prime by deleting a single digit and the other steps required.
 def isPrime ( n ) :
	if ( n <= 1 ) :
		return False ;
	if ( n <= 3 ) :
		return True ;
	if ( n % 2 == 0 or n % 3 == 0 ) :
		return False ;
	for i in range ( 5 , int ( n ** 1 / 2 ) , 6 ) :
		if ( n % i == 0 or n % ( i + 2 ) == 0 ) :
			return False ;
	return True ;
def deleteIth ( str , i ) :
	str = str [ 0 : i ] + str [ i + 1 : ] ;
	return str ;
def isPrimePossible ( N ) :
	s = str ( N ) ;
	l = len ( s ) ;
	if ( l < 2 ) :
		return False ;
	for i in range ( l ) :
		str1 = deleteIth ( s , i ) ;
		num = int ( str1 ) ;
		if ( isPrime ( num ) ) :
			return True ;
	return False ;
if __name__ == ' _ _ main _ _ ' :
	N = 610 ;
	if ( isPrimePossible ( N ) ) :
		print ( " Yes " ) ;
	else :
		print ( " No " ) ;