





def    __UpperCAmelCase(      lowercase_      ):
       # if the collection is empty, returns empty
       if collection == []:
              return []

       # get some information about the collection
       _lowerCamelCase							:     Tuple	=		len(lowercase_      )
       _lowerCamelCase							:     List[str]	=		max(lowercase_      )
       _lowerCamelCase							:     Any	=		min(lowercase_      )

       # create the counting array
       _lowerCamelCase							:     str	=		coll_max + 1 - coll_min
       _lowerCamelCase							:     Union[str, Any]	=		[0] * counting_arr_length

       # count how much a number appears in the collection
       for number in collection:
              counting_arr[number - coll_min] += 1

       # sum each position with it's predecessors. now, counting_arr[i] tells
       # us how many elements <= i has in the collection
       for i in range(1 ,    lowercase_      ):
              _lowerCamelCase							:     Union[str, Any]	=		counting_arr[i] + counting_arr[i - 1]

       # create the output collection
       _lowerCamelCase							:     Dict	=		[0] * coll_len

       # place the elements in the output, respecting the original order (stable
       # sort) from end to begin, updating counting_arr
       for i in reversed(range(0 ,    lowercase_      )      ):
              _lowerCamelCase							:     Union[str, Any]	=		collection[i]
              counting_arr[collection[i] - coll_min] -= 1

       return ordered




def    __UpperCAmelCase(      lowercase_      ):
       return "".join([chr(lowercase_      ) for i in counting_sort([ord(lowercase_      ) for c in string]      )]      )


if __name__ == "__main__":
       # Test string sort
       assert counting_sort_string('thisisthestring') == "eghhiiinrsssttt"

       _lowerCamelCase			       =      input('Enter numbers separated by a comma:\n').strip()
       _lowerCamelCase			       =      [int(item) for item in user_input.split(',')]
       print(counting_sort(unsorted))








_lowerCamelCase			       =      [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
_lowerCamelCase			       =      [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
_lowerCamelCase			       =      {
    0: 'Sunday',
    1: 'Monday',
    2: 'Tuesday',
    3: 'Wednesday',
    4: 'Thursday',
    5: 'Friday',
    6: 'Saturday',
}




def    __UpperCAmelCase(      lowercase_ ,    lowercase_ ,    lowercase_      ):
       assert len(str(lowercase_      )      ) > 2, "year should be in YYYY format"
       assert 1 <= month <= 12, "month should be between 1 to 12"
       assert 1 <= day <= 31, "day should be between 1 to 31"

       # Doomsday algorithm:
       _lowerCamelCase							:     List[Any]	=		year // 1_00
       _lowerCamelCase							:     Dict	=		(5 * (century % 4) + 2) % 7
       _lowerCamelCase							:     Tuple	=		year % 1_00
       _lowerCamelCase							:     int	=		centurian % 12
       _lowerCamelCase							:     List[Any]	=		(
           (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
       ) % 7
       _lowerCamelCase							:     List[Any]	=		(
           DOOMSDAY_NOT_LEAP[month - 1]
           if (year % 4 != 0) or (centurian == 0 and (year % 4_00) == 0)
           else DOOMSDAY_LEAP[month - 1]
       )
       _lowerCamelCase							:     Any	=		(dooms_day + day - day_anchor) % 7
       return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
       import doctest

       doctest.testmod()

