

def    __lowerCamelCase      (					UpperCamelCase__ ):







							'''simple docstring'''






							stooge(UpperCamelCase__  ,				0  ,				len(UpperCamelCase__ ) - 1 )
							return arr





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ ):







							'''simple docstring'''






							if i >= h:
														return

							# If first element is smaller than the last then swap them
							if arr[i] > arr[h]:
														snake_case_							,       snake_case_     							=       arr[h], arr[i]

							# If there are more than 2 elements in the array
							if h - i + 1 > 2:
														snake_case_     							=       (int)((h - i + 1) / 3 )

														# Recursively sort first 2/3 elements
														stooge(UpperCamelCase__  ,				UpperCamelCase__  ,				(h - t) )

														# Recursively sort last 2/3 elements
														stooge(UpperCamelCase__  ,				i + t  ,				(UpperCamelCase__) )

														# Recursively sort first 2/3 elements
														stooge(UpperCamelCase__  ,				UpperCamelCase__  ,				(h - t) )


if __name__ == "__main__":
					_UpperCAmelCase						:  Optional[int]									=			input("""Enter numbers separated by a comma:\n""").strip()
					_UpperCAmelCase						:  List[str]									=			[int(item) for item in user_input.split(""",""")]
					print(stooge_sort(unsorted))







from collections.abc import Callable







class 					lowercase							:




				def __init__(   self ,  snake_case = None			):
											# Stores actual heap items.
											snake_case_     							=       []
											# Stores indexes of each item for supporting updates and deletion.
											snake_case_     							=       {}
											# Stores current size of heap.
											snake_case_     							=       0
											# Stores function used to evaluate the score of an item on which basis ordering
											# will be done.
											snake_case_     							=       key or (lambda snake_case			: x)




				def        a				(   self ,  snake_case			):
											return int((i - 1) / 2			) if i > 0 else None




				def        a				(   self ,  snake_case			):
											snake_case_     							=       int(2 * i + 1			)
											return left if 0 < left < self.size else None




				def        a				(   self ,  snake_case			):
											snake_case_     							=       int(2 * i + 2			)
											return right if 0 < right < self.size else None




				def        a				(   self ,  snake_case ,  snake_case			):
											snake_case_							,       snake_case_     							=       (
											    self.pos_map[self.arr[j][0]],
											    self.pos_map[self.arr[i][0]],
											)
											# Then swap the items in the list.
											snake_case_							,       snake_case_     							=       self.arr[j], self.arr[i]




				def        a				(   self ,  snake_case ,  snake_case			):
											return self.arr[i][1] < self.arr[j][1]




				def        a				(   self ,  snake_case			):
											snake_case_     							=       self._left(snake_case			)
											snake_case_     							=       self._right(snake_case			)
											snake_case_     							=       i

											if left is not None and not self._cmp(snake_case ,  snake_case			):
																		snake_case_     							=       left
											if right is not None and not self._cmp(snake_case ,  snake_case			):
																		snake_case_     							=       right

											return valid_parent




				def        a				(   self ,  snake_case			):
											snake_case_     							=       self._parent(snake_case			)
											while parent is not None and not self._cmp(snake_case ,  snake_case			):
																		self._swap(snake_case ,  snake_case			)
																		snake_case_							,       snake_case_     							=       parent, self._parent(snake_case			)




				def        a				(   self ,  snake_case			):
											snake_case_     							=       self._get_valid_parent(snake_case			)
											while valid_parent != index:
																		self._swap(snake_case ,  snake_case			)
																		snake_case_							,       snake_case_     							=       valid_parent, self._get_valid_parent(snake_case			)




				def        a				(   self ,  snake_case ,  snake_case			):
											if item not in self.pos_map:
																		return
											snake_case_     							=       self.pos_map[item]
											snake_case_     							=       [item, self.key(snake_case			)]
											# Make sure heap is right in both up and down direction.
											# Ideally only one of them will make any change.
											self._heapify_up(snake_case			)
											self._heapify_down(snake_case			)




				def        a				(   self ,  snake_case			):
											if item not in self.pos_map:
																		return
											snake_case_     							=       self.pos_map[item]
											del self.pos_map[item]
											snake_case_     							=       self.arr[self.size - 1]
											snake_case_     							=       index
											self.size -= 1
											# Make sure heap is right in both up and down direction. Ideally only one
											# of them will make any change- so no performance loss in calling both.
											if self.size > index:
																		self._heapify_up(snake_case			)
																		self._heapify_down(snake_case			)




				def        a				(   self ,  snake_case ,  snake_case			):
											snake_case_     							=       len(self.arr			)
											if arr_len == self.size:
																		self.arr.append([item, self.key(snake_case			)]			)
											else:
																		snake_case_     							=       [item, self.key(snake_case			)]
											snake_case_     							=       self.size
											self.size += 1
											self._heapify_up(self.size - 1			)




				def        a				(   self			):
											return self.arr[0] if self.size else None




				def        a				(   self			):
											snake_case_     							=       self.get_top()
											if top_item_tuple:
																		self.delete_item(top_item_tuple[0]			)
											return top_item_tuple





def    __lowerCamelCase      (					):







							'''simple docstring'''








if __name__ == "__main__":
					import doctest

					doctest.testmod()




