






def 					lowercase_ (    __snake_case     :							int = 10_00      )     -> int:





				'''simple docstring'''


				snake_case__      :Union[str, Any]         =   2**power
				snake_case__      :Any         =   str(__snake_case      )
				snake_case__      :Tuple         =   list(__snake_case      )
				snake_case__      :str         =   0

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

				return sum_of_num


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







def 					lowercase_ (    __snake_case     :							list      )     -> list:





				'''simple docstring'''


				if any(not isinstance(__snake_case	,	__snake_case      ) or x < 0 for x in sequence      ):
								raise TypeError("Sequence must be list of non-negative integers"      )
				for _ in range(len(__snake_case      )      ):
								for i, (rod_upper, rod_lower) in enumerate(zip(__snake_case	,	sequence[1:]      )      ):
												if rod_upper > rod_lower:
																sequence[i] -= rod_upper - rod_lower
																sequence[i + 1] += rod_upper - rod_lower
				return sequence


if __name__ == "__main__":
	assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
	assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]