




def 				_A  (		lowerCAmelCase_	:   int     ):
     """simple docstring"""

     lowerCAmelCase__            =					1
     for i in range(1  ,							num + 1     ):
          fact *= i
     return fact



def 				_A  (		lowerCAmelCase_	:   int     ):
     """simple docstring"""

     lowerCAmelCase__            =					0
     while number > 0:
          lowerCAmelCase__            =					number % 10
          sum_of_digits += last_digit
          lowerCAmelCase__            =					number // 10  # Removing the last_digit from the given number
     return sum_of_digits



def 				_A  (		lowerCAmelCase_	:   int = 100     ):
     """simple docstring"""

     lowerCAmelCase__            =					factorial(lowerCAmelCase_     )
     lowerCAmelCase__            =					split_and_add(lowerCAmelCase_     )
     return result


if __name__ == "__main__":
     print(solution(int(input('Enter the Number: ').strip())))





from __future__ import annotations

def 	_lowerCAmelCase (    A__    ,	A__ = None						):
      lowercase__  =	word_bank or []
      # create a table
      lowercase__  =	len(A__						) + 1

      lowercase__  =	[]
      for _ in range(A__						):
            table.append([]						)
      # seed value
      lowercase__  =	[[]]  # because empty string has empty combination

      # iterate through the indices
      for i in range(A__						):
            # condition
            if table[i] != []:
                  for word in word_bank:
                        # slice condition
                        if target[i : i + len(A__						)] == word:
                              lowercase__  =	[
                                  [word, *way] for way in table[i]
                              ]
                              # adds the word to every combination the current position holds
                              # now,push that combination to the table[i+len(word)]
                              table[i + len(A__						)] += new_combinations

    # combinations are in reverse order so reverse for better output
      for combination in table[len(A__						)]:
            combination.reverse()

      return table[len(A__						)]


if __name__ == "__main__":
       print(all_construct("jwajalapa", ["jwa", "j", "w", "a", "la", "lapa"]))
       print(all_construct("rajamati", ["s", "raj", "amat", "raja", "ma", "i", "t"]))
       print(
           all_construct(
               "hexagonosaurus",
               ["h", "ex", "hex", "ag", "ago", "ru", "auru", "rus", "go", "no", "o", "s"],
           )
       )
