


'''simple docstring'''






def 						_A					(lowerCAmelCase__	:Union[str, Any]		) ->	list:




     '''simple docstring'''



     if len(lowercase_		) <= 1:
          return data
     else:
          return [
              *quick_sort([e for e in data[1:] if e <= data[0]]		),
              data[0],
              *quick_sort([e for e in data[1:] if e > data[0]]		),
          ]


if __name__ == "__main__":
 import doctest

 doctest.testmod()







"""simple docstring"""



def     _SCREAMING_SNAKE_CASE  (				lowercase_ = 10_00		)		->						int:
 A__			=							0
 A__			=							0
 while 1:
  num += 3
  if num >= n:
   break
  total += num
  num += 2
  if num >= n:
   break
  total += num
  num += 1
  if num >= n:
   break
  total += num
  num += 3
  if num >= n:
   break
  total += num
  num += 1
  if num >= n:
   break
  total += num
  num += 2
  if num >= n:
   break
  total += num
  num += 3
  if num >= n:
   break
  total += num
 return total


if __name__ == "__main__":
      print(f'{solution() = }')





