

"""simple docstring"""



import math





def  _snake_case     (    UpperCAmelCase_  :					int			):
     A__										=  [True] * n
     A__										=  False
     A__										=  False
     A__										=  True

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

     A__										=  [2]

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

     return primes





def  _snake_case     (    UpperCAmelCase_  :					int = 9999_6666_3333			):
     A__										=  math.floor(math.sqrt(UpperCAmelCase_			)			) + 100
     A__										=  prime_sieve(UpperCAmelCase_			)

     A__										=  0
     A__										=  0
     A__										=  primes[prime_index]

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

          A__										=  last_prime**2
          A__										=  next_prime**2

          # Get numbers divisible by lps(current)
          A__										=  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)
          A__										=  upper_bound - next_prime
          while current > lower_bound:
               matches_sum += current
               current -= next_prime

          # Remove the numbers divisible by both ups and lps
          A__										=  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
          A__										=  next_prime
          prime_index += 1

     return matches_sum


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








"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					list			):
     if len(UpperCAmelCase_			) <= 1:
          return lst

     A__										=  1

     while i < len(UpperCAmelCase_			):
          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_					:	Union[str, Any]							  =						input('Enter numbers separated by a comma:\n').strip()
 SCREAMING_SNAKE_CASE_					:	Union[str, Any]							  =						[int(item) for item in user_input.split(',')]
 print(gnome_sort(unsorted))






