



'''simple docstring'''
def 	lowercase_						( lowerCAmelCase__						:	str      ,				lowerCAmelCase__						:	str			):

			"""simple docstring"""





			if len(UpperCamelCase_			) < len(UpperCamelCase_			):
						return levenshtein_distance(UpperCamelCase_      ,				UpperCamelCase_			)

			if len(UpperCamelCase_			) == 0:
						return len(UpperCamelCase_			)

			__UpperCAmelCase :   Optional[int]    					=  list(range(len(UpperCamelCase_			) + 1			)			)

			for i, ca in enumerate(UpperCamelCase_			):
						__UpperCAmelCase :   int    					=  [i + 1]

						for j, ca in enumerate(UpperCamelCase_			):
									# Calculate insertions, deletions and substitutions
									__UpperCAmelCase :   Any    					=  previous_row[j + 1] + 1
									__UpperCAmelCase :   List[Any]    					=  current_row[j] + 1
									__UpperCAmelCase :   Optional[Any]    					=  previous_row[j] + (ca != ca)

									# Get the minimum to append to the current row
									current_row.append(min(UpperCamelCase_      ,				UpperCamelCase_      ,				UpperCamelCase_			)			)

						# Store the previous row
						__UpperCAmelCase :   Union[str, Any]    					=  current_row

			# Returns the last element (distance)
			return previous_row[-1]


if __name__ == "__main__":
					_UpperCamelCase									=      input('''Enter the first word:\n''').strip()
					_UpperCamelCase									=      input('''Enter the second word:\n''').strip()

					_UpperCamelCase									=      levenshtein_distance(first_word, second_word)
					print(F'Levenshtein distance between {first_word} and {second_word} is {result}')












"""simple docstring"""


def 					a			(  UpperCamelCase_				:					float		)	->		int:
 return int(UpperCamelCase_		) if x - int(UpperCamelCase_		) <= 0 else int(UpperCamelCase_		) + 1


if __name__ == "__main__":
   import doctest

   doctest.testmod()





