
def 			_SCREAMING_SNAKE_CASE      (	_lowerCamelCase				:    int = 1_000)      ->					int:






							'''simple docstring'''





							__UpperCamelCase			:     List[str]         =      2**power
							__UpperCamelCase			:     Union[str, Any]         =      str(_lowerCamelCase)
							__UpperCamelCase			:     str         =      list(_lowerCamelCase)
							__UpperCamelCase			:     Tuple         =      0

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

							return sum_of_num


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

def 			_SCREAMING_SNAKE_CASE      (	_lowerCamelCase				:    int = 200)      ->					int:






							'''simple docstring'''





							__UpperCamelCase			:     Any         =      [1, 2, 5, 10, 20, 50, 100, 200]
							__UpperCamelCase			:     Any         =      [0] * (pence + 1)
							__UpperCamelCase			:     Union[str, Any]         =      1  # base case: 1 way to make 0 pence

							for coin in coins:
														for i in range(_lowerCamelCase		,						pence + 1		,						1):
																					number_of_ways[i] += number_of_ways[i - coin]
							return number_of_ways[pence]


if __name__ == "__main__":
		assert solution(200) == 73682