'''simple docstring'''

from ...configuration_utils import PretrainedConfig
from ...utils import logging


__snake_case       :   Dict  		=    logging.get_logger(__name__)

__snake_case       :   int  		=    {
    '''openbmb/cpm-ant-10b''': '''https://huggingface.co/openbmb/cpm-ant-10b/blob/main/config.json'''
    # See all CPMAnt models at https://huggingface.co/models?filter=cpmant
}
class 							lowercase_    (     _A						):
    a_             =   """cpmant"""







    def __init__(	self       ,     UpperCamelCase__ = 3_0_7_2_0       ,     UpperCamelCase__ = 4_0_9_6       ,     UpperCamelCase__ = 3_2       ,     UpperCamelCase__ = 1_2_8       ,     UpperCamelCase__ = 1_0_2_4_0       ,     UpperCamelCase__ = 4_8       ,     UpperCamelCase__ = 0.0       ,     UpperCamelCase__ = 5_1_2       ,     UpperCamelCase__ = 2_0_4_8       ,     UpperCamelCase__ = 1e-6       ,     UpperCamelCase__ = 1.0       ,     UpperCamelCase__ = 3_2       ,     UpperCamelCase__ = 3_2       ,     UpperCamelCase__ = 3_2       ,     UpperCamelCase__ = True       ,     **UpperCamelCase__       ,     )				->       Optional[int]:





     """simple docstring"""

     super().__init__(**UpperCamelCase__				)
     UpperCAmelCase_				       =					prompt_types
     UpperCAmelCase_				       =					prompt_length
     UpperCAmelCase_				       =					segment_types
     UpperCAmelCase_				       =					hidden_size
     UpperCAmelCase_				       =					num_attention_heads
     UpperCAmelCase_				       =					dim_head
     UpperCAmelCase_				       =					dim_ff
     UpperCAmelCase_				       =					num_hidden_layers
     UpperCAmelCase_				       =					position_bias_num_buckets
     UpperCAmelCase_				       =					position_bias_max_distance
     UpperCAmelCase_				       =					dropout_p
     UpperCAmelCase_				       =					eps
     UpperCAmelCase_				       =					use_cache
     UpperCAmelCase_				       =					vocab_size
     UpperCAmelCase_				       =					init_std

'''simple docstring'''

def lowerCamelCase__						(       A_       ):
 UpperCAmelCase_				       =					len(A_       )
 for _ in range(
     0       ,			int(((no_of_elements - 1) / 2) + 1       )       ):  # we don't need to traverse to end of list as
  for j in range(0       ,			no_of_elements - 1       ):
   if (
       lst[j + 1] < lst[j]
   ):  # applying bubble sort algorithm from left to right (or forwards)
    UpperCAmelCase_				       =					lst[j + 1]
    UpperCAmelCase_				       =					lst[j]
    UpperCAmelCase_				       =					temp
   if (
       lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
   ):  # applying bubble sort algorithm from right to left (or backwards)
    UpperCAmelCase_				       =					lst[no_of_elements - 1 - j]
    UpperCAmelCase_				       =					lst[no_of_elements - 2 - j]
    UpperCAmelCase_				       =					temp
 return lst


if __name__ == "__main__":
      print('''enter the list to be sorted''')
      __snake_case       :   List[str]  		=    [int(x) for x in input().split()]  # inputing elements of the list in one line
      __snake_case       :   Optional[int]  		=    double_sort(lst)
      print('''the sorted list is''')
      print(sorted_lst)
