


from __future__ import annotations

import math
from itertools import permutations
def 							UpperCamelCase_  (				__snake_case			:						int     )->      bool:




						'''simple docstring'''

						if 1 < number < 4:
												# 2 and 3 are primes
												return True
						elif number < 2 or number % 2 == 0 or number % 3 == 0:
												# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
												return False

						# All primes number are in format of 6k +/- 1
						for i in range(5	,			int(math.sqrt(__snake_case     ) + 1     )	,			6     ):
												if number % i == 0 or number % (i + 2) == 0:
																		return False
						return True
def 							UpperCamelCase_  (				__snake_case			:						int = 7     )->      int:




						'''simple docstring'''
						__magic_name__ 		=			''.join(str(__snake_case     ) for i in range(1	,			n + 1     )     )
						__magic_name__ 		=			[int(''.join(__snake_case     )     ) for i in permutations(__snake_case	,			__snake_case     )]
						__magic_name__ 		=			[num for num in perm_list if is_prime(__snake_case     )]
						return max(__snake_case     ) if pandigitals else 0


if __name__ == "__main__":
					print(f'''{solution() = }''')





def 							UpperCamelCase_  (				__snake_case			:						int = 1_00     )->      int:




						'''simple docstring'''
						__magic_name__ 		=			1
						__magic_name__ 		=			0
						for i in range(1	,			num + 1     ):
												fact *= i

						for j in str(__snake_case     ):
												result += int(__snake_case     )

						return result


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

