

'''simple docstring'''






def 	_A  (					A__   ):






 """simple docstring"""



 __lowercase													=				len(A__   )
 for i in range(length - 1   ):
  __lowercase													=				i
  for k in range(i + 1  ,       A__   ):
   if collection[k] < collection[least]:
    __lowercase													=				k
  if least != i:
   __lowercase						,			__lowercase													=				(collection[i], collection[least])
 return collection


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




'''simple docstring'''






def 	_A  (					):






 """simple docstring"""



 for n in range(1  ,       1000000   ):
  yield n * (n + 1) // 2


def 	_A  (					A__   ):






 """simple docstring"""



 __lowercase													=				1
 __lowercase													=				2
 while i * i <= n:
  __lowercase													=				0
  while n % i == 0:
   n //= i
   multiplicity += 1
  divisors_count *= multiplicity + 1
  i += 1
 if n > 1:
  divisors_count *= 2
 return divisors_count


def 	_A  (					):






 """simple docstring"""



 return next(i for i in triangle_number_generator() if count_divisors(A__   ) > 500   )


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

