


'''simple docstring'''







from __future__ import annotations






def 	lowercase (_A    ):







       """simple docstring"""







       _lowerCAmelCase			:							List[str]      	=				[0] * max_one

       for i in range(0      ,  _A    ):
              _lowerCAmelCase			:							str      	=				i

       for i in range(2      ,  _A    ):
              if totients[i] == i:
                     for j in range(_A      ,  _A      ,  _A    ):
                            totients[j] -= totients[j] // i

       return totients






def 	lowercase (_A      ,  _A    ):







       """simple docstring"""







       return sorted(str(_A    )    ) == sorted(str(_A    )    )






def 	lowercase (_A = 1_0_0_0_0_0_0_0    ):







       """simple docstring"""







       _lowerCAmelCase			:							str      	=				1  # i
       _lowerCAmelCase			:							Union[str, Any]      	=				0  # φ(i)
       _lowerCAmelCase			:							Union[str, Any]      	=				get_totients(max_n + 1    )

       for i in range(2      ,  max_n + 1    ):
              _lowerCAmelCase			:							Union[str, Any]      	=				totients[i]

              if i * min_denominator < min_numerator * t and has_same_digits(_A      ,  _A    ):
                     _lowerCAmelCase			:							Any      	=				i
                     _lowerCAmelCase			:							Optional[Any]      	=				t

       return min_numerator


if __name__ == "__main__":
       print(F'''{solution() = }''')







'''simple docstring'''


def 		snake_case_    (UpperCamelCase       :  List[str] ,						UpperCamelCase       :  List[Any] ,						UpperCamelCase       :  Union[str, Any]      ):





							'''simple docstring'''


							_a	     =				index
							_a	     =				2 * index + 1
							_a	     =				2 * index + 2
							if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
														_a	     =				left_index

							if right_index < heap_size and unsorted[right_index] > unsorted[largest]:
														_a	     =				right_index

							if largest != index:
														_a     ,							_a	     =				unsorted[index], unsorted[largest]
														heapify(UpperCamelCase ,						UpperCamelCase ,						UpperCamelCase      )
def 		snake_case_    (UpperCamelCase       :  Union[str, Any]      ):





							'''simple docstring'''


							_a	     =				len(UpperCamelCase      )
							for i in range(n // 2 - 1 ,						-1 ,						-1      ):
														heapify(UpperCamelCase ,						UpperCamelCase ,						UpperCamelCase      )
							for i in range(n - 1 ,						0 ,						-1      ):
														_a     ,							_a	     =				unsorted[i], unsorted[0]
														heapify(UpperCamelCase ,						0 ,						UpperCamelCase      )
							return unsorted


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

