code: 
  
  
  
  
  
  '''simple docstring'''
  
  from collections import Counter
  from functools import total_ordering
  
  from data_structures.heap.heap import Heap
  
  
  @total_ordering
  class       a_  :
  
      '''simple docstring'''
  
  
      def __init__(	self				,	A				,	A )	->     None:
          _SCREAMING_SNAKE_CASE             =    word
          _SCREAMING_SNAKE_CASE             =    count
  
  
      def __eq__(	self				,	A )	->     bool:
  
  
  
  
  
  
  
          if not isinstance(UpperCamelCase__				,	UpperCamelCase__ ):
              return NotImplemented
          return self.count == other.count
  
  
  
  
  
      def __lt__(	self				,	A )	->     bool:
  
  
  
  
  
  
  
          if not isinstance(UpperCamelCase__				,	UpperCamelCase__ ):
              return NotImplemented
          return self.count < other.count
  
  
  
  
  
  def lowerCamelCase		(  __lowerCamelCase				:					Dict      , __lowerCamelCase				:					int					)		->list[str]:
      _SCREAMING_SNAKE_CASE             =    Heap()
      _SCREAMING_SNAKE_CASE             =    Counter(SCREAMING_SNAKE_CASE__					)
      heap.build_max_heap(
          [WordCount(SCREAMING_SNAKE_CASE__      , SCREAMING_SNAKE_CASE__					) for word, count in count_by_word.items()]					)
      return [heap.extract_max().word for _ in range(min(SCREAMING_SNAKE_CASE__      , len(SCREAMING_SNAKE_CASE__					)					)					)]
  
  
  if __name__ == "__main__":
        import doctest
  
        doctest.testmod()
  
  
  
  
style_context: 
  
  
  
  
  
  '''simple docstring'''
  
  def lowerCamelCase		(  __lowerCamelCase				:					int = 10**6					)		->int:
  
      if n <= 0:
          raise ValueError("""Please enter an integer greater than 0"""					)
  
      _SCREAMING_SNAKE_CASE             =    list(range(n + 1					)					)
      for number in range(2      , n + 1					):
          if phi[number] == number:
              phi[number] -= 1
              for multiple in range(number * 2      , n + 1      , __lowerCamelCase					):
                  _SCREAMING_SNAKE_CASE             =    (phi[multiple] // number) * (number - 1)
  
      _SCREAMING_SNAKE_CASE             =    1
      for number in range(1      , n + 1					):
          if (answer / phi[answer]) < (number / phi[number]):
              _SCREAMING_SNAKE_CASE             =    number
  
      return answer
  
  
  if __name__ == "__main__":
        print(solution())
  
  
  
  