


"""simple docstring"""







def 					a__ (       _UpperCamelCase ):





						"""simple docstring"""

						UpperCAmelCase__		=    len(_UpperCamelCase )
						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)
																								UpperCAmelCase__		=    lst[j + 1]
																								UpperCAmelCase__		=    lst[j]
																								UpperCAmelCase__		=    temp
																		if (
																		    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
																		):  # applying bubble sort algorithm from right to left (or backwards)
																								UpperCAmelCase__		=    lst[no_of_elements - 1 - j]
																								UpperCAmelCase__		=    lst[no_of_elements - 2 - j]
																								UpperCAmelCase__		=    temp
						return lst


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



"""simple docstring"""







from __future__ import annotations

from collections.abc import Callable
from typing import Generic, TypeVar

__a			 =   TypeVar("T")
__a			 =   TypeVar("U")
class 							lowerCamelCase       (			Generic[T, U] ):


							"""simple docstring"""






							def __init__(						self :     str		, lowerCamelCase_ :     T | None		, lowerCamelCase_ :     U | None				):
													UpperCAmelCase__		=    key
													UpperCAmelCase__		=    val
													UpperCAmelCase__		=    0
													UpperCAmelCase__		=    None
													UpperCAmelCase__		=    None






							def __repr__(						self :     Tuple				):
													return "Node: key: {}, val: {}, freq: {}, has next: {}, has prev: {}".format(
													    self.key		, self.val		, self.freq		, self.next is not None		, self.prev is not None				)




class 							lowerCamelCase       (			Generic[T, U] ):


							"""simple docstring"""






							def __init__(						self :     List[str]				):
													UpperCAmelCase__		=    DoubleLinkedListNode(lowerCamelCase_		, lowerCamelCase_				)
													UpperCAmelCase__		=    DoubleLinkedListNode(lowerCamelCase_		, lowerCamelCase_				)
													UpperCAmelCase__	,				UpperCAmelCase__		=    self.rear, self.head






							def __repr__(						self :     int				):
													UpperCAmelCase__		=    ['''DoubleLinkedList''']
													UpperCAmelCase__		=    self.head
													while node.next is not None:
																			rep.append(str(lowerCamelCase_				)				)
																			UpperCAmelCase__		=    node.next
													rep.append(str(self.rear				)				)
													return ",\n    ".join(lowerCamelCase_				)






							def 					lowerCAmelCase     (						self :     List[Any]		, lowerCamelCase_ :     DoubleLinkedListNode[T, U]				):
													UpperCAmelCase__		=    self.rear.prev

													# All nodes other than self.head are guaranteed to have non-None previous
													assert previous is not None

													UpperCAmelCase__		=    node
													UpperCAmelCase__		=    previous
													UpperCAmelCase__		=    node
													UpperCAmelCase__		=    self.rear
													node.freq += 1
													self._position_node(lowerCamelCase_				)






							def 					lowerCAmelCase     (						self :     Optional[Any]		, lowerCamelCase_ :     DoubleLinkedListNode[T, U]				):

													while node.prev is not None and node.prev.freq > node.freq:
																			# swap node with previous node
																			UpperCAmelCase__		=    node.prev

																			UpperCAmelCase__		=    previous_node.prev
																			UpperCAmelCase__		=    node.prev
																			UpperCAmelCase__		=    previous_node
																			UpperCAmelCase__		=    node






							def 					lowerCAmelCase     (						self :     Union[str, Any]		, lowerCamelCase_ :     DoubleLinkedListNode[T, U]				):

													if node.prev is None or node.next is None:
																			return None

													UpperCAmelCase__		=    node.next
													UpperCAmelCase__		=    node.prev
													UpperCAmelCase__		=    None
													UpperCAmelCase__		=    None
													return node




class 							lowerCamelCase       (			Generic[T, U] ):


							"""simple docstring"""
							SCREAMING_SNAKE_CASE										=      {}






							def __init__(						self :     str		, lowerCamelCase_ :     int				):
													UpperCAmelCase__		=    DoubleLinkedList()
													UpperCAmelCase__		=    capacity
													UpperCAmelCase__		=    0
													UpperCAmelCase__		=    0
													UpperCAmelCase__		=    0
													UpperCAmelCase__		=    {}






							def __repr__(						self :     Tuple				):
													return (
													    f"""CacheInfo(hits={self.hits}, misses={self.miss}, """
													    f"""capacity={self.capacity}, current_size={self.num_keys})"""
													)






							def __contains__(						self :     Optional[Any]		, lowerCamelCase_ :     T				):
													return key in self.cache






							def 					lowerCAmelCase     (						self :     Any		, lowerCamelCase_ :     T				):

													if key in self.cache:
																			self.hits += 1
																			UpperCAmelCase__		=    self.cache[key]
																			UpperCAmelCase__		=    self.list.remove(self.cache[key]				)
																			assert node == value_node

																			# node is guaranteed not None because it is in self.cache
																			assert node is not None
																			self.list.add(lowerCamelCase_				)
																			return node.val
													self.miss += 1
													return None






							def 					lowerCAmelCase     (						self :     Tuple		, lowerCamelCase_ :     T		, lowerCamelCase_ :     U				):

													if key not in self.cache:
																			if self.num_keys >= self.capacity:
																									# delete first node when over capacity
																									UpperCAmelCase__		=    self.list.head.next

																									# guaranteed to have a non-None first node when num_keys > 0
																									# explain to type checker via assertions
																									assert first_node is not None
																									assert first_node.key is not None
																									assert self.list.remove(lowerCamelCase_				) is not None
																									# first_node guaranteed to be in list

																									del self.cache[first_node.key]
																									self.num_keys -= 1
																			UpperCAmelCase__		=    DoubleLinkedListNode(lowerCamelCase_		, lowerCamelCase_				)
																			self.list.add(self.cache[key]				)
																			self.num_keys += 1

													else:
																			UpperCAmelCase__		=    self.list.remove(self.cache[key]				)
																			assert node is not None  # node guaranteed to be in list
																			UpperCAmelCase__		=    value
																			self.list.add(lowerCamelCase_				)






							@classmethod
							def 					lowerCAmelCase     (						cls :     type[LFUCache[T, U]]		, lowerCamelCase_ :     int = 128				):

													def cache_decorator_inner(lowerCamelCase_ :     Callable[[T], U]				) -> Callable[..., U]:
																			def cache_decorator_wrapper(*lowerCamelCase_ :     T				) -> U:
																									if func not in cls.decorator_function_to_instance_map:
																															UpperCAmelCase__		=    LFUCache(lowerCamelCase_				)

																									UpperCAmelCase__		=    cls.decorator_function_to_instance_map[func].get(args[0]				)
																									if result is None:
																															UpperCAmelCase__		=    func(*lowerCamelCase_				)
																															cls.decorator_function_to_instance_map[func].put(args[0]		, lowerCamelCase_				)
																									return result

																			def cache_info() -> LFUCache[T, U]:
																									return cls.decorator_function_to_instance_map[func]

																			setattr(lowerCamelCase_		, '''cache_info'''		, lowerCamelCase_				)  # noqa: B010

																			return cache_decorator_wrapper

													return cache_decorator_inner


if __name__ == "__main__":
						import doctest

						doctest.testmod()