
'''simple docstring'''






def    UpperCAmelCase							(  UpperCAmelCase__							:							Dict       ,							UpperCAmelCase__							:							Optional[Any]):
				lowerCamelCase					:			str									= len(__snake_case)
				lowerCamelCase					:			Any									= len(__snake_case)
				lowerCamelCase					:			Any									= [[False for _ in range(m + 1)] for _ in range(n + 1)]
				lowerCamelCase					:			int									= True
				for i in range(__snake_case):
								for j in range(m + 1):
												if dp[i][j]:
																if j < m and a[i].upper() == b[j]:
																				lowerCamelCase					:			Optional[Any]									= True
																if a[i].islower():
																				lowerCamelCase					:			str									= True
				return dp[n][m]


if __name__ == "__main__":
					import doctest

					doctest.testmod()







'''simple docstring'''






def    UpperCAmelCase							(  UpperCAmelCase__							:							int = 10_00):
				lowerCamelCase					:			Optional[Any]									= 2**power
				lowerCamelCase					:			str									= str(UpperCAmelCase__)
				lowerCamelCase					:			Union[str, Any]									= list(UpperCAmelCase__)
				lowerCamelCase					:			Optional[Any]									= 0

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

				return sum_of_num


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