


"""simple docstring"""
def 						lowercase				(	_snake_case		: Union[str, Any]	)	->str:
	"""simple docstring"""





	__snake_case      :		Tuple         =							len(_snake_case	)
	for _ in range(
	    0	,  int(((no_of_elements - 1) / 2) + 1	)	):  # we don't need to traverse to end of list as
		for j in range(0	,  no_of_elements - 1	):
			if (
			    lst[j + 1] < lst[j]
			):  # applying bubble sort algorithm from left to right (or forwards)
				__snake_case      :		int         =							lst[j + 1]
				__snake_case      :		Optional[int]         =							lst[j]
				__snake_case      :		int         =							temp
			if (
			    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
			):  # applying bubble sort algorithm from right to left (or backwards)
				__snake_case      :		List[str]         =							lst[no_of_elements - 1 - j]
				__snake_case      :		List[Any]         =							lst[no_of_elements - 2 - j]
				__snake_case      :		List[str]         =							temp
	return lst


if __name__ == "__main__":
			print("""enter the list to be sorted""")
			SCREAMING_SNAKE_CASE					:       int							   =							[int(x) for x in input().split()]  # inputing elements of the list in one line
			SCREAMING_SNAKE_CASE					:       Any							   =							double_sort(lst)
			print("""the sorted list is""")
			print(sorted_lst)









"""simple docstring"""
from __future__ import annotations

import math
import random






def 						lowercase				(	_snake_case		: int	,  _snake_case		: int	,  _snake_case		: int	)	->list[int]:
	"""simple docstring"""





	__snake_case      :		Tuple         =							d * e - 1
	__snake_case      :		List[str]         =							0
	__snake_case      :		Dict         =							0
	while p == 0:
		__snake_case      :		str         =							random.randint(2	,  n - 1	)
		__snake_case      :		int         =							k
		while True:
			if t % 2 == 0:
				__snake_case      :		int         =							t // 2
				__snake_case      :		int         =							(g**t) % n
				__snake_case      :		Optional[Any]         =							math.gcd(x - 1	,  _snake_case	)
				if x > 1 and y > 1:
					__snake_case      :		Tuple         =							y
					__snake_case      :		int         =							n // y
					break  # find the correct factors
			else:
				break  # t is not divisible by 2, break and choose another g
	return sorted([p, q]	)


if __name__ == "__main__":
			import doctest

			doctest.testmod()





