





def lowerCamelCase__   (							snake_case_     :  int	)				->    bool:
   return number & 1 == 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()








# Algorithm for the pigeonhole sorting








def lowerCamelCase__   (							snake_case_     :  int	)				->    Optional[int]:
   __snake_case								=       min(snake_case_	)  # min() finds the minimum value
   __snake_case								=       max(snake_case_	)  # max() finds the maximum value

   __snake_case								=       max_val - min_val + 1  # size is difference of max and min values plus one

   # list of pigeonholes of size equal to the variable size
   __snake_case								=       [0] * size

   # Populate the pigeonholes.
   for x in a:
      assert isinstance(snake_case_	,				snake_case_	), "integers only please"
      holes[x - min_val] += 1

   # Putting the elements back into the array in an order.
   __snake_case								=       0
   for count in range(snake_case_	):
      while holes[count] > 0:
         holes[count] -= 1
         __snake_case								=       count + min_val
         i += 1






def lowerCamelCase__   (							)				->    Union[str, Any]:
   __snake_case								=       [8, 3, 2, 7, 4, 6, 8]
   pigeonhole_sort(snake_case_	)
   print('''Sorted order is:'''	,				''' '''.join(snake_case_	)	)


if __name__ == "__main__":
    main()

