
'''simple docstring'''






from __future__ import annotations

# This is the precision for this function which can be altered.
# It is recommended for users to keep this number greater than or equal to 10.
A			      =      10





def    UpperCAmelCase							(  UpperCAmelCase__							:							int       ,							UpperCAmelCase__							:							int       ,							UpperCAmelCase__							:							list[int]       ,							UpperCAmelCase__							:							int):
				for i in range(UpperCAmelCase__       ,							UpperCAmelCase__):
								if array[i] == target:
												return i
				return -1





def    UpperCAmelCase							(  UpperCAmelCase__							:							list[int]       ,							UpperCAmelCase__							:							int):
				lowerCamelCase					:			Dict									= 0
				lowerCamelCase					:			Union[str, Any]									= len(UpperCAmelCase__)
				while left <= right:
								if right - left < precision:
												return lin_search(UpperCAmelCase__       ,							UpperCAmelCase__       ,							UpperCAmelCase__       ,							UpperCAmelCase__)

								lowerCamelCase					:			Any									= (left + right) // 3 + 1
								lowerCamelCase					:			Optional[int]									= 2 * (left + right) // 3 + 1

								if array[one_third] == target:
												return one_third
								elif array[two_third] == target:
												return two_third

								elif target < array[one_third]:
												lowerCamelCase					:			Tuple									= one_third - 1
								elif array[two_third] < target:
												lowerCamelCase					:			Union[str, Any]									= two_third + 1

								else:
												lowerCamelCase					:			Tuple									= one_third + 1
												lowerCamelCase					:			Union[str, Any]									= two_third - 1
				else:
								return -1





def    UpperCAmelCase							(  UpperCAmelCase__							:							int       ,							UpperCAmelCase__							:							int       ,							UpperCAmelCase__							:							list[int]       ,							UpperCAmelCase__							:							int):
				if left < right:
								if right - left < precision:
												return lin_search(UpperCAmelCase__       ,							UpperCAmelCase__       ,							UpperCAmelCase__       ,							UpperCAmelCase__)
								lowerCamelCase					:			List[str]									= (left + right) // 3 + 1
								lowerCamelCase					:			Any									= 2 * (left + right) // 3 + 1

								if array[one_third] == target:
												return one_third
								elif array[two_third] == target:
												return two_third

								elif target < array[one_third]:
												return rec_ternary_search(UpperCAmelCase__       ,							one_third - 1       ,							UpperCAmelCase__       ,							UpperCAmelCase__)
								elif array[two_third] < target:
												return rec_ternary_search(two_third + 1       ,							UpperCAmelCase__       ,							UpperCAmelCase__       ,							UpperCAmelCase__)
								else:
												return rec_ternary_search(one_third + 1       ,							two_third - 1       ,							UpperCAmelCase__       ,							UpperCAmelCase__)
				else:
								return -1


if __name__ == "__main__":
					import doctest

					doctest.testmod()

					A			      =      input('Enter numbers separated by comma:\n').strip()
					A			      =      [int(item.strip()) for item in user_input.split(',')]
					assert collection == sorted(collection), f"List must be ordered.\n{collection}."
					A			      =      int(input('Enter the number to be found in the list:\n').strip())
					A			      =      ite_ternary_search(collection, target)
					A			      =      rec_ternary_search(0, len(collection) - 1, collection, target)
					if resulta != -1:
										print(f"""Iterative search: {target} found at positions: {resulta}""")
										print(f"""Recursive search: {target} found at positions: {resulta}""")
					else:
										print('Not found')


'''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)
