



'''simple docstring'''





class 				_snake_case			:




				def __init__(						self					:						List[Any]						):
							lowercase__					  =				""
							lowercase__					  =				""
							lowercase__					  =				[]




				def 							A__      (						self					:						List[str],					__lowercase					:						int,					__lowercase					:						int						):







							if m == -1:
										return n + 1
							elif n == -1:
										return m + 1
							elif self.dp[m][n] > -1:
										return self.dp[m][n]
							else:
										if self.worda[m] == self.worda[n]:
													lowercase__					  =				self.__min_dist_top_down_dp(m - 1,					n - 1						)
										else:
													lowercase__					  =				self.__min_dist_top_down_dp(__lowercase,					n - 1						)
													lowercase__					  =				self.__min_dist_top_down_dp(m - 1,					__lowercase						)
													lowercase__					  =				self.__min_dist_top_down_dp(m - 1,					n - 1						)
													lowercase__					  =				1 + min(__lowercase,					__lowercase,					__lowercase						)

										return self.dp[m][n]




				def 							A__      (						self					:						Optional[int],					__lowercase					:						str,					__lowercase					:						str						):
							lowercase__					  =				worda
							lowercase__					  =				worda
							lowercase__					  =				[[-1 for _ in range(len(__lowercase						)						)] for _ in range(len(__lowercase						)						)]

							return self.__min_dist_top_down_dp(len(__lowercase						) - 1,					len(__lowercase						) - 1						)




				def 							A__      (						self					:						Optional[int],					__lowercase					:						str,					__lowercase					:						str						):
							lowercase__					  =				worda
							lowercase__					  =				worda
							lowercase__					  =				len(__lowercase						)
							lowercase__					  =				len(__lowercase						)
							lowercase__					  =				[[0 for _ in range(n + 1						)] for _ in range(m + 1						)]

							for i in range(m + 1						):
										for j in range(n + 1						):
													if i == 0:  # first string is empty
																lowercase__					  =				j
													elif j == 0:  # second string is empty
																lowercase__					  =				i
													elif worda[i - 1] == worda[j - 1]:  # last characters are equal
																lowercase__					  =				self.dp[i - 1][j - 1]
													else:
																lowercase__					  =				self.dp[i][j - 1]
																lowercase__					  =				self.dp[i - 1][j]
																lowercase__					  =				self.dp[i - 1][j - 1]
																lowercase__					  =				1 + min(__lowercase,					__lowercase,					__lowercase						)
							return self.dp[m][n]


if __name__ == "__main__":
							lowercase_								=     EditDistance()

							print("""****************** Testing Edit Distance DP Algorithm ******************""")
							print()

							lowercase_								=     input("""Enter the first string: """).strip()
							lowercase_								=     input("""Enter the second string: """).strip()

							print()
							print(F'The minimum edit distance is: {solver.min_dist_top_down(Sa, Sa)}')
							print(F'The minimum edit distance is: {solver.min_dist_bottom_up(Sa, Sa)}')
							print()
							print("""*************** End of Testing Edit Distance DP Algorithm ***************""")









def __lowerCAmelCase (     SCREAMING_SNAKE_CASE_  ):
			lowercase__					  =				len(SCREAMING_SNAKE_CASE_  )
			for i in range(SCREAMING_SNAKE_CASE_  ):
						for j in range(i + 1						,  SCREAMING_SNAKE_CASE_  ):
									if numbers[j] < numbers[i]:
												lowercase__  ,       lowercase__					  =				numbers[j], numbers[i]
			return numbers


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




