


from ..utils import (
    OptionalDependencyNotAvailable,
    is_flax_available,
    is_scipy_available,
    is_torch_available,
    is_torchsde_available,
)


try:
	if not is_torch_available():
		raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
	from ..utils.dummy_pt_objects import *  # noqa F403
else:
	from .scheduling_consistency_models import CMStochasticIterativeScheduler
	from .scheduling_ddim import DDIMScheduler
	from .scheduling_ddim_inverse import DDIMInverseScheduler
	from .scheduling_ddim_parallel import DDIMParallelScheduler
	from .scheduling_ddpm import DDPMScheduler
	from .scheduling_ddpm_parallel import DDPMParallelScheduler
	from .scheduling_deis_multistep import DEISMultistepScheduler
	from .scheduling_dpmsolver_multistep import DPMSolverMultistepScheduler
	from .scheduling_dpmsolver_multistep_inverse import DPMSolverMultistepInverseScheduler
	from .scheduling_dpmsolver_singlestep import DPMSolverSinglestepScheduler
	from .scheduling_euler_ancestral_discrete import EulerAncestralDiscreteScheduler
	from .scheduling_euler_discrete import EulerDiscreteScheduler
	from .scheduling_heun_discrete import HeunDiscreteScheduler
	from .scheduling_ipndm import IPNDMScheduler
	from .scheduling_k_dpm_2_ancestral_discrete import KDPMaAncestralDiscreteScheduler
	from .scheduling_k_dpm_2_discrete import KDPMaDiscreteScheduler
	from .scheduling_karras_ve import KarrasVeScheduler
	from .scheduling_pndm import PNDMScheduler
	from .scheduling_repaint import RePaintScheduler
	from .scheduling_sde_ve import ScoreSdeVeScheduler
	from .scheduling_sde_vp import ScoreSdeVpScheduler
	from .scheduling_unclip import UnCLIPScheduler
	from .scheduling_unipc_multistep import UniPCMultistepScheduler
	from .scheduling_utils import KarrasDiffusionSchedulers, SchedulerMixin
	from .scheduling_vq_diffusion import VQDiffusionScheduler

try:
	if not is_flax_available():
		raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
	from ..utils.dummy_flax_objects import *  # noqa F403
else:
	from .scheduling_ddim_flax import FlaxDDIMScheduler
	from .scheduling_ddpm_flax import FlaxDDPMScheduler
	from .scheduling_dpmsolver_multistep_flax import FlaxDPMSolverMultistepScheduler
	from .scheduling_karras_ve_flax import FlaxKarrasVeScheduler
	from .scheduling_lms_discrete_flax import FlaxLMSDiscreteScheduler
	from .scheduling_pndm_flax import FlaxPNDMScheduler
	from .scheduling_sde_ve_flax import FlaxScoreSdeVeScheduler
	from .scheduling_utils_flax import (
	    FlaxKarrasDiffusionSchedulers,
	    FlaxSchedulerMixin,
	    FlaxSchedulerOutput,
	    broadcast_to_shape_from_left,
	)


try:
	if not (is_torch_available() and is_scipy_available()):
		raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
	from ..utils.dummy_torch_and_scipy_objects import *  # noqa F403
else:
	from .scheduling_lms_discrete import LMSDiscreteScheduler

try:
	if not (is_torch_available() and is_torchsde_available()):
		raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
	from ..utils.dummy_torch_and_torchsde_objects import *  # noqa F403
else:
	from .scheduling_dpmsolver_sde import DPMSolverSDEScheduler




"""simple docstring"""






from __future__ import annotations


def __lowercase     (      lowerCamelCase_  :      list						,					lowerCamelCase_  :      int						,					lowerCamelCase_  :      int						,					lowerCamelCase_  :      int  ):
				SCREAMING_SNAKE_CASE__     							=				[]
				SCREAMING_SNAKE_CASE__							,      SCREAMING_SNAKE_CASE__     							=				input_list[low:mid], input_list[mid : high + 1]
				while left and right:
								result.append((left if left[0] <= right[0] else right).pop(0  )  )
				SCREAMING_SNAKE_CASE__     							=				result + left + right
				return input_list


def __lowercase     (      lowerCamelCase_  :      list  ):
				if len(lowerCamelCase_  ) <= 1:
								return input_list
				SCREAMING_SNAKE_CASE__     							=				list(lowerCamelCase_  )

				# iteration for two-way merging
				SCREAMING_SNAKE_CASE__     							=				2
				while p <= len(lowerCamelCase_  ):
								# getting low, high and middle value for merge-sort of single list
								for i in range(0						,					len(lowerCamelCase_  )						,					lowerCamelCase_  ):
												SCREAMING_SNAKE_CASE__     							=				i
												SCREAMING_SNAKE_CASE__     							=				i + p - 1
												SCREAMING_SNAKE_CASE__     							=				(low + high + 1) // 2
												SCREAMING_SNAKE_CASE__     							=				merge(lowerCamelCase_						,					lowerCamelCase_						,					lowerCamelCase_						,					lowerCamelCase_  )
								# final merge of last two parts
								if p * 2 >= len(lowerCamelCase_  ):
												SCREAMING_SNAKE_CASE__     							=				i
												SCREAMING_SNAKE_CASE__     							=				merge(lowerCamelCase_						,					0						,					lowerCamelCase_						,					len(lowerCamelCase_  ) - 1  )
												break
								p *= 2

				return input_list


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