




'''simple docstring'''


def 					SCREAMING_SNAKE_CASE(   __lowercase	)			-> Optional[int]:
     A:		Optional[int]          =		len(__lowercase	)
     for _ in range(
         0		,				int(((no_of_elements - 1) / 2) + 1	)	):  # we don't need to traverse to end of list as
          for j in range(0		,				no_of_elements - 1	):
               if (
                   lst[j + 1] < lst[j]
               ):  # applying bubble sort algorithm from left to right (or forwards)
                    A:		Dict          =		lst[j + 1]
                    A:		Union[str, Any]          =		lst[j]
                    A:		Dict          =		temp
               if (
                   lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
               ):  # applying bubble sort algorithm from right to left (or backwards)
                    A:		List[Any]          =		lst[no_of_elements - 1 - j]
                    A:		Dict          =		lst[no_of_elements - 2 - j]
                    A:		List[str]          =		temp
     return lst


if __name__ == "__main__":
     print('''enter the list to be sorted''')
     UpperCamelCase			     =					[int(x) for x in input().split()]  # inputing elements of the list in one line
     UpperCamelCase			     =					double_sort(lst)
     print('''the sorted list is''')
     print(sorted_lst)












'''simple docstring'''


from __future__ import annotations

import random






class 						lowerCAmelCase_	:







  '''simple docstring'''

  UpperCamelCase_			:      Optional[int]										=				6



  def __init__( self				:							Dict	)			->		Dict:







       '''simple docstring'''



       A:		Union[str, Any]          =		list(range(1					,  Dice.NUM_SIDES + 1	)	)




  def 					_snake_case     ( self				:							Optional[Any]	)			->		Any:







       '''simple docstring'''



       return random.choice(self.sides	)






def 					SCREAMING_SNAKE_CASE(   __lowercase		,				__lowercase = 2	)			-> list[float]:
     A:		Union[str, Any]          =		[Dice() for i in range(__lowercase	)]
     A:		Union[str, Any]          =		[0] * (len(__lowercase	) * Dice.NUM_SIDES + 1)
     for _ in range(__lowercase	):
          count_of_sum[sum(dice.roll() for dice in dices	)] += 1
     A:		Dict          =		[round((count * 1_0_0) / num_throws		,				2	) for count in count_of_sum]
     return probability[num_dice:]  # remove probability of sums that never appear


if __name__ == "__main__":
     import doctest

     doctest.testmod()






