




# Copyright 2023 The HuggingFace Team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


_lowerCamelCase      			=						{
    'configuration_mgp_str': ['MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP', 'MgpstrConfig'],
    'processing_mgp_str': ['MgpstrProcessor'],
    'tokenization_mgp_str': ['MgpstrTokenizer'],
}

try:
 if not is_torch_available():
  raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
 pass
else:
 _lowerCamelCase      			=						[
     'MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST',
     'MgpstrModel',
     'MgpstrPreTrainedModel',
     'MgpstrForSceneTextRecognition',
 ]

if TYPE_CHECKING:
 from .configuration_mgp_str import MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP, MgpstrConfig
 from .processing_mgp_str import MgpstrProcessor
 from .tokenization_mgp_str import MgpstrTokenizer

 try:
  if not is_torch_available():
   raise OptionalDependencyNotAvailable()
 except OptionalDependencyNotAvailable:
  pass
 else:
  from .modeling_mgp_str import (
      MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST,
      MgpstrForSceneTextRecognition,
      MgpstrModel,
      MgpstrPreTrainedModel,
  )
else:
 import sys

 _lowerCamelCase      			=						_LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)











def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						Optional[Any]				)  ->							Union[str, Any]:
    UpperCAmelCase_										=					len(__UpperCamelCase				)
    while cur > 1:
        # Find the maximum number in arr
        UpperCAmelCase_										=					arr.index(max(arr[0:cur]				)				)
        # Reverse from 0 to mi
        UpperCAmelCase_										=					arr[mi::-1] + arr[mi + 1 : len(__UpperCamelCase				)]
        # Reverse whole list
        UpperCAmelCase_										=					arr[cur - 1 :: -1] + arr[cur : len(__UpperCamelCase				)]
        cur -= 1
    return arr


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





