


'''simple docstring'''







from __future__ import annotations






def 			lowercase				(_A					):







       """simple docstring"""







       _lowerCAmelCase    :							List[Any]   			=       [True] * limit
       _lowerCAmelCase    :							Optional[int]   			=       False
       _lowerCAmelCase    :							Dict   			=       False
       _lowerCAmelCase    :							Optional[Any]   			=       True

       for i in range(3   ,						int(limit**0.5 + 1					)   ,						2					):
              _lowerCAmelCase    :							Tuple   			=       i * 2
              while index < limit:
                     _lowerCAmelCase    :							Union[str, Any]   			=       False
                     _lowerCAmelCase    :							Any   			=       index + i

       _lowerCAmelCase    :							Dict   			=       [2]

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

       return primes






def 			lowercase				(_A = 1_0_0_0_0_0_0					):







       """simple docstring"""







       _lowerCAmelCase    :							List[Any]   			=       prime_sieve(_A					)
       _lowerCAmelCase    :							Optional[Any]   			=       0
       _lowerCAmelCase    :							Any   			=       0

       for i in range(len(_A					)					):
              for j in range(i + length   ,						len(_A					)					):
                     _lowerCAmelCase    :							List[str]   			=       sum(primes[i:j]					)
                     if sol >= ceiling:
                            break

                     if sol in primes:
                            _lowerCAmelCase    :							Union[str, Any]   			=       j - i
                            _lowerCAmelCase    :							str   			=       sol

       return largest


if __name__ == "__main__":
       print(F'''{solution() = }''')






'''simple docstring'''







def 			lowercase				(_A					):







       """simple docstring"""







       _lowerCAmelCase    :							Dict   			=       len(_A					)
       while cur > 1:
              # Find the maximum number in arr
              _lowerCAmelCase    :							int   			=       arr.index(max(arr[0:cur]					)					)
              # Reverse from 0 to mi
              _lowerCAmelCase    :							Dict   			=       arr[mi::-1] + arr[mi + 1 : len(_A					)]
              # Reverse whole list
              _lowerCAmelCase    :							Optional[int]   			=       arr[cur - 1 :: -1] + arr[cur : len(_A					)]
              cur -= 1
       return arr


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

