

import random




def 						_A						(						UpperCamelCase_  : List[str])			->		Optional[Any]:
   '''simple docstring'''


   def is_sorted(UpperCamelCase_  : List[str]):
      for i in range(len(UpperCamelCase_) - 1):
         if collection[i] > collection[i + 1]:
            return False
      return True

   while not is_sorted(UpperCamelCase_):
      random.shuffle(UpperCamelCase_)
   return collection


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







"""simple docstring"""





def 						_A						(						UpperCamelCase_  : list,    UpperCamelCase_  : list,    UpperCamelCase_  : list,    UpperCamelCase_  : int,    UpperCamelCase_  : int)			->		None:
   '''simple docstring'''


   if target == 0:
      answer.append(path.copy())
   else:
      for index in range(UpperCamelCase_,    len(UpperCamelCase_)):
         if target >= candidates[index]:
            path.append(candidates[index])
            backtrack(UpperCamelCase_,    UpperCamelCase_,    UpperCamelCase_,    target - candidates[index],    UpperCamelCase_)
            path.pop(len(UpperCamelCase_) - 1)




def 						_A						(						UpperCamelCase_  : list,    UpperCamelCase_  : int)			->		list:
   '''simple docstring'''


   __lowercase			=		[]  # type: list[int]
   __lowercase			=		[]  # type: list[int]
   backtrack(UpperCamelCase_,    UpperCamelCase_,    UpperCamelCase_,    UpperCamelCase_,    0)
   return answer




def 						_A						(						)			->		None:
   '''simple docstring'''


   print(combination_sum([-8, 2.3, 0],    1))


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   main()




