




from __future__ import annotations

def    UpperCAmelCase_				( __UpperCAmelCase		:      list				)   ->					list:
      if len(__UpperCAmelCase				) == 0:
            return []
      SCREAMING_SNAKE_CASE_		,					SCREAMING_SNAKE_CASE_      		=     min(__UpperCAmelCase				), max(__UpperCAmelCase				)
      SCREAMING_SNAKE_CASE_      		=     int(max_value - min_value				) + 1
      SCREAMING_SNAKE_CASE_      		=     [[] for _ in range(__UpperCAmelCase				)]

      for i in my_list:
            buckets[int(i - min_value				)].append(__UpperCAmelCase				)

      return [v for bucket in buckets for v in sorted(__UpperCAmelCase				)]


if __name__ == "__main__":
   from doctest import testmod

   testmod()
   assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
   assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]





'''simple docstring'''





from math import ceil





def       __a      (  _UpperCamelCase:       int = 1_001       )		->					int:

     """simple docstring"""




     _snake_case				= 1

     for i in range(1   ,		int(ceil(n / 2.0       )       )       ):
          _snake_case				= 2 * i + 1
          _snake_case				= 2 * i
          _snake_case				= total + 4 * odd**2 - 6 * even

     return total


if __name__ == "__main__":
   import sys

   if len(sys.argv) == 1:
      print(solution())
   else:
      try:
         UpperCamelCase_		:     int          =		int(sys.argv[1])
         print(solution(n))
      except ValueError:
         print('''Invalid entry - please enter a number''')


