def 	__lowerCamelCase							(				__a    : List[str]		)      ->       Tuple:
	_lowercase   =len(__a		)
	for i in range(length - 1		):
		_lowercase   =False
		for j in range(length - 1 - i		):
			if collection[j] > collection[j + 1]:
				_lowercase   =True
				_lowercase   ,  _lowercase   =collection[j + 1], collection[j]
		if not swapped:
			break  # Stop iteration if the collection is sorted.
	return collection


if __name__ == "__main__":
						import doctest
						import time

						doctest.testmod()

						lowerCAmelCase__  	=      input("Enter numbers separated by a comma:").strip()
						lowerCAmelCase__  	=      [int(item) for item in user_input.split(",")]
						lowerCAmelCase__  	=      time.process_time()
						print(*bubble_sort(unsorted), sep=",")
						print(F'''Processing time: {(time.process_time() - start)%1E9 + 7}''')







import itertools






def        __lowercase   (  _A = 1000000      )  ->    int:
      SCREAMING_SNAKE_CASE			:   Tuple	  = [1]

      for i in itertools.count(len(_A      )      ):
            SCREAMING_SNAKE_CASE			:   Optional[int]	  = 0
            for j in itertools.count(1      ):
                  SCREAMING_SNAKE_CASE			:   str	  = -1 if j % 2 == 0 else +1
                  SCREAMING_SNAKE_CASE			:   Any	  = (j * j * 3 - j) // 2
                  if index > i:
                        break
                  item += partitions[i - index] * sign
                  item %= number
                  index += j
                  if index > i:
                        break
                  item += partitions[i - index] * sign
                  item %= number

            if item == 0:
                  return i
            partitions.append(_A      )

      return 0


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  print(F"""{solution() = }""")




