
"""simple docstring"""






def 		_snake_case			(      lowercase__						:    Dict ,	lowercase__						:    Dict						)    ->							List[str]:


			'''simple docstring'''





			sequence.append(lowercase__						)

			lowerCAmelCase_       :Any     	=    0
			while sequence[index] != target:
						index += 1

			sequence.pop()

			if index == len(lowercase__						):
						return None

			return index


if __name__ == "__main__":
				__UpperCAmelCase 					=    input('Enter numbers separated by comma:\n').strip()
				__UpperCAmelCase 					=    [int(item) for item in user_input.split(',')]

				__UpperCAmelCase 					=    input('Enter a single number to be found in the list:\n')
				__UpperCAmelCase 					=    int(target_input)
				__UpperCAmelCase 					=    sentinel_linear_search(sequence, target)
				if result is not None:
								print(F"""{target} found at positions: {result}""")
				else:
								print('Not found')








"""simple docstring"""






import math






def 		_snake_case			(      lowercase__						:    int						)    ->							int:


			'''simple docstring'''





			return sum(int(lowercase__						) for digit in str(lowercase__						)						)






def 		_snake_case			(      lowercase__						:    int = 3_0						)    ->							int:


			'''simple docstring'''





			lowerCAmelCase_       :Union[str, Any]     	=    []
			for digit in range(2 ,	1_0_0						):
						for power in range(2 ,	1_0_0						):
									lowerCAmelCase_       :Tuple     	=    int(math.pow(lowercase__ ,	lowercase__						)						)
									if digit == digit_sum(lowercase__						):
												digit_to_powers.append(lowercase__						)

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


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






