


import numpy as np
def      snake_case_						( __lowercase			,       __lowercase			,       __lowercase			,       __lowercase			,       __lowercase       ):
   UpperCAmelCase_							:      Tuple						=   int(np.ceil((x_end - xa) / h       )       )
   UpperCAmelCase_							:      Tuple						=   np.zeros((n + 1,)       )
   UpperCAmelCase_							:      int						=   ya
   UpperCAmelCase_							:      Tuple						=   xa

   for k in range(__lowercase       ):
      UpperCAmelCase_							:      int						=   f(__lowercase			,       y[k]       )
      UpperCAmelCase_							:      Union[str, Any]						=   f(x + 0.5 * h			,       y[k] + 0.5 * h * ka       )
      UpperCAmelCase_							:      Dict						=   f(x + 0.5 * h			,       y[k] + 0.5 * h * ka       )
      UpperCAmelCase_							:      Optional[Any]						=   f(x + h			,       y[k] + h * ka       )
      UpperCAmelCase_							:      Union[str, Any]						=   y[k] + (1 / 6) * h * (ka + 2 * ka + 2 * ka + ka)
      x += h

   return y


if __name__ == "__main__":
       import doctest

       doctest.testmod()



def      snake_case_						( __lowercase       ):
   return " ".join(
       ''''''.join(word[::-1]       ) if len(__lowercase       ) > 4 else word for word in sentence.split()       )


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       print(reverse_long_words('Hey wollef sroirraw'))