






import math






def 					lowerCamelCase__					(_UpperCAmelCase):
			SCREAMING_SNAKE_CASE							=			[True] * n
			SCREAMING_SNAKE_CASE							=			False
			SCREAMING_SNAKE_CASE							=			False
			SCREAMING_SNAKE_CASE							=			True

			for i in range(3				,							int(n**0.5 + 1)				,							2):
						SCREAMING_SNAKE_CASE							=			i * 2
						while index < n:
									SCREAMING_SNAKE_CASE							=			False
									SCREAMING_SNAKE_CASE							=			index + i

			SCREAMING_SNAKE_CASE							=			[2]

			for i in range(3				,							_UpperCAmelCase				,							2):
						if is_prime[i]:
									primes.append(_UpperCAmelCase)

			return primes






def 					lowerCamelCase__					(_UpperCAmelCase = 9999_6666_3333):
			SCREAMING_SNAKE_CASE							=			math.floor(math.sqrt(_UpperCAmelCase)) + 100
			SCREAMING_SNAKE_CASE							=			prime_sieve(_UpperCAmelCase)

			SCREAMING_SNAKE_CASE							=			0
			SCREAMING_SNAKE_CASE							=			0
			SCREAMING_SNAKE_CASE							=			primes[prime_index]

			while (last_prime**2) <= limit:
						SCREAMING_SNAKE_CASE							=			primes[prime_index + 1]

						SCREAMING_SNAKE_CASE							=			last_prime**2
						SCREAMING_SNAKE_CASE							=			next_prime**2

						# Get numbers divisible by lps(current)
						SCREAMING_SNAKE_CASE							=			lower_bound + last_prime
						while upper_bound > current <= limit:
									matches_sum += current
									current += last_prime

						# Reset the upper_bound
						while (upper_bound - next_prime) > limit:
									upper_bound -= next_prime

						# Add the numbers divisible by ups(current)
						SCREAMING_SNAKE_CASE							=			upper_bound - next_prime
						while current > lower_bound:
									matches_sum += current
									current -= next_prime

						# Remove the numbers divisible by both ups and lps
						SCREAMING_SNAKE_CASE							=			0
						while upper_bound > current <= limit:
									if current <= lower_bound:
												# Increment the current number
												current += last_prime * next_prime
												continue

									if current > limit:
												break

									# Remove twice since it was added by both ups and lps
									matches_sum -= current * 2

									# Increment the current number
									current += last_prime * next_prime

						# Setup for next pair
						SCREAMING_SNAKE_CASE							=			next_prime
						prime_index += 1

			return matches_sum


if __name__ == "__main__":
				print(solution())





"""simple docstring"""




def 				_UpperCAmelCase		(							lowerCamelCase__  ):





		"""simple docstring"""




		if len(lowerCamelCase__  ) <= 1:
				return lst

		lowerCAmelCase__   = 1

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

		return lst


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




