




import math
def  snake_case_					(		SCREAMING_SNAKE_CASE_    )      ->			int:
							return sum(int(SCREAMING_SNAKE_CASE_    ) for digit in str(SCREAMING_SNAKE_CASE_    )    )
def  snake_case_					(		SCREAMING_SNAKE_CASE_ = 30    )      ->			int:
							lowercase__  :	List[str]        =							[]
							for digit in range(2    ,1_00    ):
														for power in range(2    ,1_00    ):
																					lowercase__  :	List[Any]        =							int(math.pow(SCREAMING_SNAKE_CASE_    ,SCREAMING_SNAKE_CASE_    )    )
																					if digit == digit_sum(SCREAMING_SNAKE_CASE_    ):
																												digit_to_powers.append(SCREAMING_SNAKE_CASE_    )

							digit_to_powers.sort()
							return digit_to_powers[n - 1]


if __name__ == "__main__":
						print(solution())





def  snake_case_					(		SCREAMING_SNAKE_CASE_    )      ->			list:
							lowercase__  :	Optional[Any]        =							len(SCREAMING_SNAKE_CASE_    )

							# Set the gap value to be decreased by a factor of 1.3
							# after each iteration
							lowercase__  :	Tuple        =							1.3

							# Continue sorting until the gap is 1
							while gap > 1:
														# Decrease the gap value
														lowercase__  :	Tuple        =							int(gap / shrink    )

														# Sort the elements using insertion sort
														for i in range(SCREAMING_SNAKE_CASE_    ,len(SCREAMING_SNAKE_CASE_    )    ):
																					lowercase__  :	int        =							collection[i]
																					lowercase__  :	Union[str, Any]        =							i
																					while j >= gap and collection[j - gap] > temp:
																												lowercase__  :	str        =							collection[j - gap]
																												j -= gap
																					lowercase__  :	List[Any]        =							temp

							return collection


if __name__ == "__main__":
						import doctest

						doctest.testmod()