






def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_  )   ->  int:


	"""simple docstring"""



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

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

	a		=			list(range(len(snake_case_  ) + 1  )  )

	for i, ca in enumerate(snake_case_  ):
		a		=			[i + 1]

		for j, ca in enumerate(snake_case_  ):
			# Calculate insertions, deletions and substitutions
			a		=			previous_row[j + 1] + 1
			a		=			current_row[j] + 1
			a		=			previous_row[j] + (ca != ca)

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

		# Store the previous row
		a		=			current_row

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


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

				UpperCamelCase__						:      Dict								=					levenshtein_distance(first_word, second_word)
				print(F"Levenshtein distance between {first_word} and {second_word} is {result}")













def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  int:


	"""simple docstring"""



	return n * (2 * n - 1)





def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  bool:


	"""simple docstring"""



	a		=			(1 + 2_4 * n) ** 0.5
	return ((1 + root) / 6) % 1 == 0





def   SCREAMING_SNAKE_CASE__						(   snake_case_ = 1_4_4  )   ->  int:


	"""simple docstring"""



	a		=			start
	a		=			hexagonal_num(snake_case_  )
	while not is_pentagonal(snake_case_  ):
		n += 1
		a		=			hexagonal_num(snake_case_  )
	return num


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





