


'''simple docstring'''

def __snake_case      (   UpperCAmelCase_		:		List[Any]	):
 lowerCamelCase_  				=						len(UpperCAmelCase_	)
 for i in range(length - 1	):
  lowerCamelCase_  				=						i
  for k in range(i + 1      ,       UpperCAmelCase_	):
   if collection[k] < collection[least]:
    lowerCamelCase_  				=						k
  if least != i:
   lowerCamelCase_				,lowerCamelCase_  				=						(collection[i], collection[least])
 return collection


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







'''simple docstring'''

from collections.abc import Sequence





def __snake_case      (   UpperCAmelCase_		:		Sequence[int] | None = None	):
 if nums is None or not nums:
  raise ValueError("Input sequence should not be empty"	)

 lowerCamelCase_  				=						nums[0]
 for i in range(1      ,       len(UpperCAmelCase_	)	):
  lowerCamelCase_  				=						nums[i]
  lowerCamelCase_  				=						max(UpperCAmelCase_      ,       ans + num      ,       UpperCAmelCase_	)

 return ans


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     # Try on a sample input from the user
     a_						:       Any      			=				int(input("""Enter number of elements : """).strip())
     a_						:       Union[str, Any]      			=				list(map(int, input("""\nEnter the numbers : """).strip().split()))[:n]
     print(max_subsequence_sum(array))



