




from __future__ import annotations


class        UpperCamelCase_					:

    '''simple docstring'''






    def __init__(    self   :			Union[str, Any]      ,				UpperCAmelCase__   :			int)		->None:





           '''simple docstring'''

           A__   				=					data
           A__   				=					None
           A__   				=					None







def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> None:  # In Order traversal of the tree



       """simple docstring"""

       if tree:
              display(tree.left		)
              print(tree.data		)
              display(tree.right		)







def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> int:



       """simple docstring"""

       return 1 + max(depth_of_tree(tree.left		)				,       depth_of_tree(tree.right		)		) if tree else 0







def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> bool:



       """simple docstring"""

       if not tree:
              return True
       if tree.left and tree.right:
              return is_full_binary_tree(tree.left		) and is_full_binary_tree(tree.right		)
       else:
              return not tree.left and not tree.right







def SCREAMING_SNAKE_CASE       ( )     -> None:  # Main function for testing.



       """simple docstring"""

       A__   				=					Node(1		)
       A__   				=					Node(2		)
       A__   				=					Node(3		)
       A__   				=					Node(4		)
       A__   				=					Node(5		)
       A__   				=					Node(6		)
       A__   				=					Node(7		)
       A__   				=					Node(8		)
       A__   				=					Node(9		)

       print(is_full_binary_tree(lowercase_		)		)
       print(depth_of_tree(lowercase_		)		)
       print('''Tree is: '''		)
       display(lowercase_		)


if __name__ == "__main__":
  main()








def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> int:



       """simple docstring"""

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







def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> int:



       """simple docstring"""

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







def SCREAMING_SNAKE_CASE       ( lowercase_ = 100		)     -> int:



       """simple docstring"""

       A__   				=					factorial(lowercase_		)
       A__   				=					split_and_add(lowercase_		)
       return result


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


