




"""simple docstring"""

def 						_snake_case					( _snake_case							: Any							)   -> Any:






      '''simple docstring'''


      stooge(_snake_case    ,  0    ,  len(_snake_case							) - 1							)
      return arr






def 						_snake_case					( _snake_case							: List[Any]    ,  _snake_case							: Dict    ,  _snake_case							: Optional[Any]							)   -> Union[str, Any]:






      '''simple docstring'''


      if i >= h:
            return

      # If first element is smaller than the last then swap them
      if arr[i] > arr[h]:
            _A       ,   _A        =       arr[h], arr[i]

      # If there are more than 2 elements in the array
      if h - i + 1 > 2:
            _A        =       (int)((h - i + 1) / 3							)

            # Recursively sort first 2/3 elements
            stooge(_snake_case    ,  _snake_case    ,  (h - t)							)

            # Recursively sort last 2/3 elements
            stooge(_snake_case    ,  i + t    ,  (_snake_case)							)

            # Recursively sort first 2/3 elements
            stooge(_snake_case    ,  _snake_case    ,  (h - t)							)


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







"""simple docstring"""

def 						_snake_case					( _snake_case							: int							)   -> list:






      '''simple docstring'''


      _A        =       int(_snake_case							)
      if n_element < 1:
            _A        =       ValueError('a should be a positive number'							)
            raise my_error

      _A        =       [1]
      _A       ,   _A       ,   _A        =       (0, 0, 0)
      _A        =       1
      while index < n_element:
            while hamming_list[i] * 2 <= hamming_list[-1]:
                  i += 1
            while hamming_list[j] * 3 <= hamming_list[-1]:
                  j += 1
            while hamming_list[k] * 5 <= hamming_list[-1]:
                  k += 1
            hamming_list.append(
                min(hamming_list[i] * 2    ,  hamming_list[j] * 3    ,  hamming_list[k] * 5							)							)
            index += 1
      return hamming_list


if __name__ == "__main__":
       a         =      input('''Enter the last number (nth term) of the Hamming Number Series: ''')
       print('''Formula of Hamming Number Series => 2^i * 3^j * 5^k''')
       a         =      hamming(int(n))
       print('''-----------------------------------------------------''')
       print(F'''The list with nth numbers is: {hamming_numbers}''')
       print('''-----------------------------------------------------''')

