





'''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.
lowerCAmelCase_					:    List[Any]      	=			10






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






def  _lowerCamelCase				( lowercase						:      list[int]    ,							lowercase						:      int						)	->	int:
				_a								= 0
				_a								= len(lowercase						)
				while left <= right:
								if right - left < precision:
												return lin_search(lowercase    ,							lowercase    ,							lowercase    ,							lowercase						)

								_a								= (left + right) // 3 + 1
								_a								= 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]:
												_a								= one_third - 1
								elif array[two_third] < target:
												_a								= two_third + 1

								else:
												_a								= one_third + 1
												_a								= two_third - 1
				else:
								return -1






def  _lowerCamelCase				( lowercase						:      int    ,							lowercase						:      int    ,							lowercase						:      list[int]    ,							lowercase						:      int						)	->	int:
				if left < right:
								if right - left < precision:
												return lin_search(lowercase    ,							lowercase    ,							lowercase    ,							lowercase						)
								_a								= (left + right) // 3 + 1
								_a								= 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(lowercase    ,							one_third - 1    ,							lowercase    ,							lowercase						)
								elif array[two_third] < target:
												return rec_ternary_search(two_third + 1    ,							lowercase    ,							lowercase    ,							lowercase						)
								else:
												return rec_ternary_search(one_third + 1    ,							two_third - 1    ,							lowercase    ,							lowercase						)
				else:
								return -1


if __name__ == "__main__":
					import doctest

					doctest.testmod()

					lowerCAmelCase_					:    int      	=			input('Enter numbers separated by comma:\n').strip()
					lowerCAmelCase_					:    Tuple      	=			[int(item.strip()) for item in user_input.split(',')]
					assert collection == sorted(collection), f"List must be ordered.\n{collection}."
					lowerCAmelCase_					:    str      	=			int(input('Enter the number to be found in the list:\n').strip())
					lowerCAmelCase_					:    Optional[int]      	=			ite_ternary_search(collection, target)
					lowerCAmelCase_					:    Optional[int]      	=			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  _lowerCamelCase				( lowercase						:      int = 100						)	->	int:
				_a								= 0
				_a								= 0
				for i in range(1    ,							n + 1						):
								sum_of_squares += i**2
								sum_of_ints += i
				return sum_of_ints**2 - sum_of_squares


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