


def 						_lowerCAmelCase							(     _lowerCAmelCase			)    ->						bool:


						'''simple docstring'''






						return str(_lowerCAmelCase			) == str(_lowerCAmelCase			)[::-1]





def 						_lowerCAmelCase							(     _lowerCAmelCase			)    ->						int:


						'''simple docstring'''






						return int(_lowerCAmelCase			) + int(str(_lowerCAmelCase			)[::-1]			)





def 						_lowerCAmelCase							(     _lowerCAmelCase = 1_0000			)    ->						int:


						'''simple docstring'''






						__snake_case				=		[]
						for num in range(1   ,						_lowerCAmelCase			):
												__snake_case				=		0
												__snake_case				=		num
												while iterations < 50:
																		__snake_case				=		sum_reverse(_lowerCAmelCase			)
																		iterations += 1
																		if is_palindrome(_lowerCAmelCase			):
																								break
												else:
																		lychrel_nums.append(_lowerCAmelCase			)
						return len(_lowerCAmelCase			)


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









def 						_lowerCAmelCase							(     _lowerCAmelCase = 1000			)    ->						int:


						'''simple docstring'''






						__snake_case				=		2**power
						__snake_case				=		str(_lowerCAmelCase			)
						__snake_case				=		list(_lowerCAmelCase			)
						__snake_case				=		0

						for i in list_num:
												sum_of_num += int(_lowerCAmelCase			)

						return sum_of_num


if __name__ == "__main__":
	A				:       Optional[Any]      =  int(input('Enter the power of 2: ').strip())
	print('2 ^ ', power, ' = ', 2**power)
	A				:       List[Any]      =  solution(power)
	print('Sum of the digits is: ', result)





