


"""simple docstring"""






def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:List[Any]  )				-> list:
						a_							:			Union[str, Any]     		=					[True for i in range(n + 1  )]
						a_							:			List[Any]     		=					[i - 1 for i in range(n + 1  )]
						a_							:			Optional[Any]     		=					[]
						for i in range(2		,			n + 1  ):
												if is_prime[i]:
																		primes.append(_SCREAMING_SNAKE_CASE  )
												for j in range(0		,			len(_SCREAMING_SNAKE_CASE  )  ):
																		if i * primes[j] >= n:
																								break
																		a_							:			List[str]     		=					False

																		if i % primes[j] == 0:
																								a_							:			Optional[int]     		=					totients[i] * primes[j]
																								break

																		a_							:			Optional[Any]     		=					totients[i] * (primes[j] - 1)

						return totients


if __name__ == "__main__":
				import doctest

				doctest.testmod()





"""simple docstring"""






def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:int  )				-> Optional[int]:
						a_							:			List[Any]     		=					len(_SCREAMING_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)
																								a_							:			List[str]     		=					lst[j + 1]
																								a_							:			Optional[Any]     		=					lst[j]
																								a_							:			Optional[Any]     		=					temp
																		if (
																		    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
																		):  # applying bubble sort algorithm from right to left (or backwards)
																								a_							:			Dict     		=					lst[no_of_elements - 1 - j]
																								a_							:			Dict     		=					lst[no_of_elements - 2 - j]
																								a_							:			Any     		=					temp
						return lst


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




