
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.
SCREAMING_SNAKE_CASE__							=				10




def 							__SCREAMING_SNAKE_CASE   (		SCREAMING_SNAKE_CASE       :      int    ,							SCREAMING_SNAKE_CASE       :      int    ,							SCREAMING_SNAKE_CASE       :      list[int]    ,							SCREAMING_SNAKE_CASE       :      int			)     ->						int:

				for i in range(snake_case_    ,							snake_case_			):
								if array[i] == target:
												return i
				return -1




def 							__SCREAMING_SNAKE_CASE   (		SCREAMING_SNAKE_CASE       :      list[int]    ,							SCREAMING_SNAKE_CASE       :      int			)     ->						int:
				__lowercase								=					0
				__lowercase								=					len(snake_case_			)
				while left <= right:
								if right - left < precision:
												return lin_search(snake_case_    ,							snake_case_    ,							snake_case_    ,							snake_case_			)

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

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




def 							__SCREAMING_SNAKE_CASE   (		SCREAMING_SNAKE_CASE       :      int    ,							SCREAMING_SNAKE_CASE       :      int    ,							SCREAMING_SNAKE_CASE       :      list[int]    ,							SCREAMING_SNAKE_CASE       :      int			)     ->						int:

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


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							SCREAMING_SNAKE_CASE__							=				input("""Enter numbers separated by comma:\n""").strip()
							SCREAMING_SNAKE_CASE__							=				[int(item.strip()) for item in user_input.split(""",""")]
							assert collection == sorted(collection), F"List must be ordered.\n{collection}."
							SCREAMING_SNAKE_CASE__							=				int(input("""Enter the number to be found in the list:\n""").strip())
							SCREAMING_SNAKE_CASE__							=				ite_ternary_search(collection, target)
							SCREAMING_SNAKE_CASE__							=				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_						(					snake_case_       :       Union[str, Any]=2_81_23      )					->     str:






 '''simple docstring'''

 __lowerCAmelCase											=						[1] * (limit + 1)

 for i in range(2						,		int(limit**0.5      ) + 1      ):
  sum_divs[i * i] += i
  for k in range(i + 1						,		limit // i + 1      ):
   sum_divs[k * i] += k + i

 __lowerCAmelCase											=						set()
 __lowerCAmelCase											=						0

 for n in range(1						,		limit + 1      ):
  if sum_divs[n] > n:
   abundants.add(snake_case_      )

  if not any((n - a in abundants) for a in abundants      ):
   res += n

 return res


if __name__ == "__main__":
 print(solution())






