

from __future__ import annotations



def   __UpperCAmelCase					(      __a :     str      )     ->	Optional[int]:

					"""simple docstring"""

					create_state_space_tree(__a						,[]						,0						,[0 for i in range(len(__a      )      )]      )



def   __UpperCAmelCase					(      __a :     Union[str, Any]						,__a :     Union[str, Any]						,__a :     Optional[int]						,__a :     Optional[Any]						,)     ->	List[Any]:

					"""simple docstring"""

					if index == len(__a      ):
										print(__a      )
										return

					for i in range(len(__a      )      ):
										if not index_used[i]:
															current_sequence.append(sequence[i]      )
															_a      :       Optional[Any]   =						True
															create_state_space_tree(__a						,__a						,index + 1						,__a      )
															current_sequence.pop()
															_a      :       Optional[int]   =						False
a__												=						[3, 1, 2, 4]
generate_all_permutations(sequence)

a__												=						["A", "B", "C"]







generate_all_permutations(sequence_a)










def    _A	(   lowerCamelCase ):
   a__						:    Optional[Any]   		=	1
   for i in range(1				,			num + 1 ):
      fact *= i
   return fact






def    _A	(   lowerCamelCase ):
   a__						:    List[Any]   		=	0
   while number > 0:
      a__						:    str   		=	number % 10
      sum_of_digits += last_digit
      a__						:    Dict   		=	number // 10  # Removing the last_digit from the given number
   return sum_of_digits






def    _A	(   lowerCamelCase = 100 ):
   a__						:    Any   		=	factorial(lowerCamelCase )
   a__						:    Optional[Any]   		=	split_and_add(lowerCamelCase )
   return result


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

