


def __UpperCAmelCase							(		__A      )    ->       Optional[Any]:



       '''simple docstring'''





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





def __UpperCAmelCase							(		__A      )    ->       Optional[Any]:



       '''simple docstring'''





       UpperCAmelCase__					    =  0
       while number > 0:
              UpperCAmelCase__					    =  number % 1_0
              sum_of_digits += last_digit
              UpperCAmelCase__					    =  number // 1_0  # Removing the last_digit from the given number
       return sum_of_digits





def __UpperCAmelCase							(		__A = 1_0_0      )    ->       Optional[Any]:



       '''simple docstring'''





       UpperCAmelCase__					    =  factorial(__UpperCamelCase      )
       UpperCAmelCase__					    =  split_and_add(__UpperCamelCase      )
       return result


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











'''simple docstring'''



class 							_a				:





       '''simple docstring'''






       def __init__(      self,							A  ):







             '''simple docstring'''







             SCREAMING_SNAKE_CASE   :      Tuple    					=						val
             SCREAMING_SNAKE_CASE   :      Any    					=						None
             SCREAMING_SNAKE_CASE   :      Union[str, Any]    					=						None







       def        UpperCamelCase_							(      self,							A  ):







             '''simple docstring'''







             if self.val:
                   if val < self.val:
                         if self.left is None:
                               SCREAMING_SNAKE_CASE   :      Optional[int]    					=						Node(A  )
                         else:
                               self.left.insert(A  )
                   elif val > self.val:
                         if self.right is None:
                               SCREAMING_SNAKE_CASE   :      int    					=						Node(A  )
                         else:
                               self.right.insert(A  )
             else:
                   SCREAMING_SNAKE_CASE   :      int    					=						val




def   lowercase__(			__UpperCamelCase:					Optional[int]      ,__UpperCamelCase:					List[str]    ):

      """simple docstring"""






      if root:
            inorder(root.left      ,__UpperCamelCase    )
            res.append(root.val    )
            inorder(root.right      ,__UpperCamelCase    )




def   lowercase__(			__UpperCamelCase:					List[Any]    ):

      """simple docstring"""






      if len(__UpperCamelCase    ) == 0:
            return arr
      SCREAMING_SNAKE_CASE   :      Optional[int]    					=						Node(arr[0]    )
      for i in range(1      ,len(__UpperCamelCase    )    ):
            root.insert(arr[i]    )
      # Traverse BST in order.
      SCREAMING_SNAKE_CASE   :      Dict    					=						[]
      inorder(__UpperCamelCase      ,__UpperCamelCase    )
      return res


if __name__ == "__main__":
      print(tree_sort([1_0, 1, 3, 2, 9, 1_4, 1_3]))


