

'''simple docstring'''
def  _lowerCAmelCase      (		_UpperCamelCase		:  str							,				_UpperCamelCase		:  str       )   ->    int:
     """simple docstring"""




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

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

     _SCREAMING_SNAKE_CASE												=list(range(len(_UpperCamelCase       ) + 1       )       )

     for i, ca in enumerate(_UpperCamelCase       ):
          _SCREAMING_SNAKE_CASE												=[i + 1]

          for j, ca in enumerate(_UpperCamelCase       ):
               # Calculate insertions, deletions and substitutions
               _SCREAMING_SNAKE_CASE												=previous_row[j + 1] + 1
               _SCREAMING_SNAKE_CASE												=current_row[j] + 1
               _SCREAMING_SNAKE_CASE												=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
          _SCREAMING_SNAKE_CASE												=current_row

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


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

     lowerCamelCase				:   List[Any]      				=  levenshtein_distance(first_word, second_word)
     print(f'''Levenshtein distance between {first_word} and {second_word} is {result}''')



'''simple docstring'''
def  _lowerCAmelCase      (		_UpperCamelCase		:  list       )   ->    list:
     """simple docstring"""




     for i, _ in enumerate(_UpperCamelCase       ):
          if (i % 2 == 1) == (nums[i - 1] > nums[i]):
               _SCREAMING_SNAKE_CASE					,		_SCREAMING_SNAKE_CASE												=nums[i], nums[i - 1]

     return nums


if __name__ == "__main__":
     print("Enter the array elements:")
     lowerCamelCase				:   Tuple      				=  list(map(int, input().split()))
     print("The unsorted array is:")
     print(array)
     print("Array after Wiggle sort:")
     print(wiggle_sort(array))
