



"""simple docstring"""

def    __snake_case       (  __A			:	int = 30    )    ->					int:






				'''simple docstring'''
				SCREAMING_SNAKE_CASE	:       str 							=    exponent + 2
				SCREAMING_SNAKE_CASE	:       List[Any] 							=    (1 + 5**0.5) / 2
				SCREAMING_SNAKE_CASE	:       List[Any] 							=    (phi**fibonacci_index - (phi - 1) ** fibonacci_index) / 5**0.5

				return int(__A    )


if __name__ == "__main__":
							print(f'''{solution() = }''')










"""simple docstring"""

def    __snake_case       (  __A			:	str       ,		__A			:	str    )    ->					int:






				'''simple docstring'''
				# The longer word should come first
				if len(__A    ) < len(__A    ):
								return levenshtein_distance(__A       ,		__A    )

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

				SCREAMING_SNAKE_CASE	:       List[Any] 							=    list(range(len(__A    ) + 1    )    )

				for i, ca in enumerate(__A    ):
								SCREAMING_SNAKE_CASE	:       Union[str, Any] 							=    [i + 1]

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

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

								# Store the previous row
								SCREAMING_SNAKE_CASE	:       Tuple 							=    current_row

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


if __name__ == "__main__":
							A_	:						Optional[int]				=			input('Enter the first word:\n').strip()
							A_	:						Optional[Any]				=			input('Enter the second word:\n').strip()

							A_	:						str				=			levenshtein_distance(first_word, second_word)
							print(f'''Levenshtein distance between {first_word} and {second_word} is {result}''')





