import functools
def 							lowerCAmelCase(     __lowerCamelCase				,    __lowerCamelCase						):
     __a		 =       len(__lowerCamelCase						)
     __a		 =       len(__lowerCamelCase						)

     @functools.cache
     def min_distance(__lowerCamelCase				,    __lowerCamelCase						) -> int:
          # if first word index is overflow - delete all from the second word
          if indexa >= len_worda:
               return len_worda - indexa
          # if second word index is overflow - delete all from the first word
          if indexa >= len_worda:
               return len_worda - indexa
          __a		 =       int(worda[indexa] != worda[indexa]						)  # current letters not identical
          return min(
              1 + min_distance(indexa + 1				,    __lowerCamelCase						)				,    1 + min_distance(__lowerCamelCase				,    indexa + 1						)				,    diff + min_distance(indexa + 1				,    indexa + 1						)				,    )

     return min_distance(0				,    0						)


if __name__ == "__main__":
 import doctest

 doctest.testmod()





from __future__ import annotations

import numpy as np
def 							lowerCAmelCase(     __lowerCamelCase						):
					return np.maximum(0				,    __lowerCamelCase						)


if __name__ == "__main__":
	print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]




