




import random




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						List[Any]	,					__UpperCamelCase      :						int	,					__UpperCamelCase      :						Tuple				)  ->							Dict:
    UpperCAmelCase_										=					a[left_index]
    UpperCAmelCase_										=					left_index + 1
    for j in range(left_index + 1	,					__UpperCamelCase				):
        if a[j] < pivot:
            UpperCAmelCase_			,							UpperCAmelCase_										=					a[i], a[j]
            i += 1
    UpperCAmelCase_			,							UpperCAmelCase_										=					a[i - 1], a[left_index]
    return i - 1




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						Tuple	,					__UpperCamelCase      :						Any	,					__UpperCamelCase      :						Any				)  ->							str:
    if left < right:
        UpperCAmelCase_										=					random.randint(__UpperCamelCase	,					right - 1				)
        UpperCAmelCase_			,							UpperCAmelCase_										=					(
            a[left],
            a[pivot],
        )  # switches the pivot with the left most bound
        UpperCAmelCase_										=					partition(__UpperCamelCase	,					__UpperCamelCase	,					__UpperCamelCase				)
        quick_sort_random(
            __UpperCamelCase	,					__UpperCamelCase	,					__UpperCamelCase				)  # recursive quicksort to the left of the pivot point
        quick_sort_random(
            __UpperCamelCase	,					pivot_index + 1	,					__UpperCamelCase				)  # recursive quicksort to the right of the pivot point




def  SCREAMING_SNAKE_CASE     (	)  ->							Dict:
    UpperCAmelCase_										=					input('''Enter numbers separated by a comma:\n'''				).strip()
    UpperCAmelCase_										=					[int(__UpperCamelCase				) for item in user_input.split(''','''				)]

    quick_sort_random(__UpperCamelCase	,					0	,					len(__UpperCamelCase				)				)

    print(__UpperCamelCase				)


if __name__ == "__main__":
 main()











def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						Dict=2_8123				)  ->							str:
    UpperCAmelCase_										=					[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

    UpperCAmelCase_										=					set()
    UpperCAmelCase_										=					0

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

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

    return res


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





