

def     lowerCAmelCase__							(		SCREAMING_SNAKE_CASE_:							Optional[Any]=2_8_1_2_3					)	->					List[str]:




				'''simple docstring'''





				A__						=	[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

				A__						=	set()
				A__						=	0

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

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

				return res


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








def A_	(		A__				)  ->		int:
       stooge(A__		,      0		,      len(A__				) - 1				)
       return arr



def A_	(		A__		,      A__		,      A__				)  ->		List[Any]:
       if i >= h:
              return

       # If first element is smaller than the last then swap them
       if arr[i] > arr[h]:
              a__ ,							a__						:	List[str] =				arr[h], arr[i]

       # If there are more than 2 elements in the array
       if h - i + 1 > 2:
              a__						:	Dict =				(int)((h - i + 1) / 3				)

              # Recursively sort first 2/3 elements
              stooge(A__		,      A__		,      (h - t)				)

              # Recursively sort last 2/3 elements
              stooge(A__		,      i + t		,      (A__)				)

              # Recursively sort first 2/3 elements
              stooge(A__		,      A__		,      (h - t)				)


if __name__ == "__main__":
    lowercase      :       Dict									=  input("""Enter numbers separated by a comma:\n""").strip()
    lowercase      :       Dict									=  [int(item) for item in user_input.split(""",""")]
    print(stooge_sort(unsorted))


