





'''simple docstring'''




def 	UpperCAmelCase_							(					__lowercase							:      Union[str, Any]       )		->       List[Any]:


     '''simple docstring'''



     _UpperCAmelCase     							=   len(__lowercase       )
     _UpperCAmelCase     							=   sum(__lowercase       )

     _UpperCAmelCase     							=   [[False for x in range(s + 1       )] for y in range(n + 1       )]

     for i in range(1			,     n + 1       ):
          _UpperCAmelCase     							=   True

     for i in range(1			,     s + 1       ):
          _UpperCAmelCase     							=   False

     for i in range(1			,     n + 1       ):
          for j in range(1			,     s + 1       ):
               _UpperCAmelCase     							=   dp[i][j - 1]

               if arr[i - 1] <= j:
                    _UpperCAmelCase     							=   dp[i][j] or dp[i - 1][j - arr[i - 1]]

     for j in range(int(s / 2       )			,     -1			,     -1       ):
          if dp[n][j] is True:
               _UpperCAmelCase     							=   s - 2 * j
               break

     return diff











'''simple docstring'''




def 	UpperCAmelCase_							(					__lowercase							:      str       )		->       str:


     '''simple docstring'''



     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'''))




