"""simple docstring"""






import math



def     a_		(   lowerCamelCase			):
				return sum(int(lowerCAmelCase_			) for digit in str(lowerCAmelCase_			)			)



def     a_		(   lowerCamelCase = 3_0			):
				UpperCAmelCase__			 =				[]
				for digit in range(2   ,     1_0_0			):
								for power in range(2   ,     1_0_0			):
												UpperCAmelCase__			 =				int(math.pow(lowerCAmelCase_   ,     lowerCAmelCase_			)			)
												if digit == digit_sum(lowerCAmelCase_			):
																digit_to_powers.append(lowerCAmelCase_			)

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


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








'''simple docstring'''






import itertools




def        snake_case_   (	lowerCAmelCase_						)->						Dict:





       '''simple docstring'''


       return (
           int("""""".join(combination[0:2]						)						) * int("""""".join(combination[2:5]						)						)
           == int("""""".join(combination[5:9]						)						)
       ) or (
           int("""""".join(combination[0]						)						) * int("""""".join(combination[1:5]						)						)
           == int("""""".join(combination[5:9]						)						)
       )




def        snake_case_   (	)->						str:





       '''simple docstring'''


       return sum(
           {
               int("""""".join(pandigital[5:9]						)						)
               for pandigital in itertools.permutations("""123456789"""						)
               if is_combination_valid(lowerCAmelCase_						)
           }						)


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



