






def        lowerCamelCase__   (					__lowerCamelCase    :  str						,	__lowerCamelCase    :  str	):
  # The longer word should come first
  if len(__lowerCamelCase	) < len(__lowerCamelCase	):
    return levenshtein_distance(__lowerCamelCase						,	__lowerCamelCase	)

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

  __UpperCAmelCase							:			str     =						list(range(len(__lowerCamelCase	) + 1	)	)

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

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

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

    # Store the previous row
    __UpperCAmelCase							:			Dict     =						current_row

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


if __name__ == "__main__":
       a	: List[Any]      =				input("Enter the first word:\n").strip()
       a	: List[Any]      =				input("Enter the second word:\n").strip()

       a	: Union[str, Any]      =				levenshtein_distance(first_word, second_word)
       print(f"""Levenshtein distance between {first_word} and {second_word} is {result}""")










import decimal






def        lowerCamelCase__   (					):
  __UpperCAmelCase							:			str     =						0
  __UpperCAmelCase							:			Tuple     =						decimal.Context(prec=105	)
  for i in range(2						,	100	):
    __UpperCAmelCase							:			Optional[int]     =						decimal.Decimal(__lowerCamelCase	)
    __UpperCAmelCase							:			Any     =						number.sqrt(__lowerCamelCase	)
    if len(str(__lowerCamelCase	)	) > 1:
      answer += int(str(__lowerCamelCase	)[0]	)
      __UpperCAmelCase							:			Optional[Any]     =						str(__lowerCamelCase	)[2:101]
      answer += sum(int(__lowerCamelCase	) for x in sqrt_number_str	)
  return answer


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       print(f"""{solution() = }""")


