"""simple docstring"""



from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst



def 	_lowerCamelCase(	):
       __a ,   __a       =    9, 1_4  # noqa: F841
       __a       =    [
           [0, 1, 4],
           [0, 7, 8],
           [1, 2, 8],
           [7, 8, 7],
           [7, 6, 1],
           [2, 8, 2],
           [8, 6, 6],
           [2, 3, 7],
           [2, 5, 4],
           [6, 5, 2],
           [3, 5, 1_4],
           [3, 4, 9],
           [5, 4, 1_0],
           [1, 7, 1_1],
       ]

       __a       =    defaultdict(a				)
       for nodea, nodea, cost in edges:
              adjancency[nodea].append([nodea, cost]				)
              adjancency[nodea].append([nodea, cost]				)

       __a       =    mst(a				)

       __a       =    [
           [7, 6, 1],
           [2, 8, 2],
           [6, 5, 2],
           [0, 1, 4],
           [2, 5, 4],
           [2, 3, 7],
           [0, 7, 8],
           [3, 4, 9],
       ]

       for answer in expected:
              __a       =    tuple(answer[:2]				)
              __a       =    tuple(edge[::-1]				)
              assert edge in result or reverse in result

"""simple docstring"""



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


if __name__ == "__main__":
   import doctest

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