






def    UpperCAmelCase__	(						lowerCamelCase  : int = 10_00						):
   lowerCamelCase											=0
   lowerCamelCase											=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() = }")







import random






def    UpperCAmelCase__	(						lowerCamelCase  : Optional[Any]						):

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

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


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