
import math





class 							UpperCAmelCase      :




	'''simple docstring'''





	def __init__(       self					: Optional[int]							,A					: Dict=0 ):  # a graph with Node 0,1,...,N-1
					__A   			= n
					__A   			= [
					    [math.inf for j in range(0							,A )] for i in range(0							,A )
					]  # adjacency matrix for weight
					__A   			= [
					    [math.inf for j in range(0							,A )] for i in range(0							,A )
					]  # dp[i][j] stores minimum distance from i to j






	def 				UpperCamelCase_  (       self					: List[str]							,A					: Tuple							,A					: Union[str, Any]							,A					: Optional[int] ):
					__A   			= w






	def 				UpperCamelCase_  (       self					: int ):
					for k in range(0							,self.n ):
									for i in range(0							,self.n ):
													for j in range(0							,self.n ):
																	__A   			= min(self.dp[i][j]							,self.dp[i][k] + self.dp[k][j] )







	def 				UpperCamelCase_  (       self					: Optional[int]							,A					: str							,A					: Union[str, Any] ):
					return self.dp[u][v]


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE							:Optional[int]							 =				Graph(5)
					graph.add_edge(0, 2, 9)
					graph.add_edge(0, 4, 10)
					graph.add_edge(1, 3, 5)
					graph.add_edge(2, 3, 7)
					graph.add_edge(3, 0, 10)
					graph.add_edge(3, 1, 2)
					graph.add_edge(3, 2, 1)
					graph.add_edge(3, 4, 6)
					graph.add_edge(4, 1, 3)
					graph.add_edge(4, 2, 4)
					graph.add_edge(4, 3, 9)
					graph.floyd_warshall()
					graph.show_min(1, 4)
					graph.show_min(0, 3)


def 						UpperCAmelCase			(	a_						)		->	list:







				"""simple docstring"""



				if len(a_						) <= 1:
								return lst

				__A   			= 1

				while i < len(a_						):
								if lst[i - 1] <= lst[i]:
												i += 1
								else:
												__A			,							__A   			= lst[i], lst[i - 1]
												i -= 1
												if i == 0:
																__A   			= 1

				return lst


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