"""simple docstring"""



from math import factorial

SCREAMING_SNAKE_CASE__:dict[str, int]									=			{str(digit): factorial(digit) for digit in range(10)}



def 	_lowerCamelCase(	a				):
       if not isinstance(a   ,    a				):
              raise TypeError("Parameter number must be int"				)

       if number < 0:
              raise ValueError("Parameter number must be greater than or equal to 0"				)

       # Converts number in string to iterate on its digits and adds its factorial.
       return sum(DIGIT_FACTORIAL[digit] for digit in str(a				)				)



def 	_lowerCamelCase(	a = 6_0   ,    a = 1_0_0_0_0_0_0				):

       if not isinstance(a   ,    a				) or not isinstance(a   ,    a				):
              raise TypeError("Parameters chain_length and number_limit must be int"				)

       if chain_length <= 0 or number_limit <= 0:
              raise ValueError(
                  "Parameters chain_length and number_limit must be greater than 0"				)

       # the counter for the chains with the exact desired length
       __a       =    0
       # the cached sizes of the previous chains
       __a       =    {}

       for start_chain_element in range(1   ,    a				):
              # The temporary set will contain the elements of the chain
              __a       =    set()
              __a       =    0

              # Stop computing the chain when you find a cached size, a repeating item or the
              # length is greater then the desired one.
              __a       =    start_chain_element
              while (
                  chain_element not in chain_sets_lengths
                  and chain_element not in chain_set
                  and chain_set_length <= chain_length
              ):
                     chain_set.add(a				)
                     chain_set_length += 1
                     __a       =    digit_factorial_sum(a				)

              if chain_element in chain_sets_lengths:
                     chain_set_length += chain_sets_lengths[chain_element]

              __a       =    chain_set_length

              # If chain contains the exact amount of elements increase the counter
              if chain_set_length == chain_length:
                     chains_counter += 1

       return chains_counter


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   print(F'''{solution()}''')

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