
def 							a__					(							snake_case							):





  """simple docstring"""
  if not isinstance(snake_case       ,			snake_case							):
    raise ValueError('''Input must be an integer'''							)
  if input_num <= 0:
    raise ValueError('''Input must be positive'''							)
  return sum(
      divisor for divisor in range(1       ,			input_num // 2 + 1							) if input_num % divisor == 0							)


if __name__ == "__main__":
   import doctest

   doctest.testmod()







def   __lowerCamelCase   (				__a  :Optional[Any]       )						->							Tuple:






		"""simple docstring"""

		A__     =  len(__a       )
		while cur > 1:
				# Find the maximum number in arr
				A__     =  arr.index(max(arr[0:cur]       )       )
				# Reverse from 0 to mi
				A__     =  arr[mi::-1] + arr[mi + 1 : len(__a       )]
				# Reverse whole list
				A__     =  arr[cur - 1 :: -1] + arr[cur : len(__a       )]
				cur -= 1
		return arr


if __name__ == "__main__":
					A       :   List[str]					= input('''Enter numbers separated by a comma:\n''').strip()
					A       :   int					= [int(item) for item in user_input.split(''',''')]
					print(pancake_sort(unsorted))



