






"""simple docstring"""




from math import sqrt






def 						_SCREAMING_SNAKE_CASE							( UpperCamelCase     :	int    ):
		A__											=							[1]
		for i in range(2		,				int(sqrt(UpperCamelCase    )    ) + 1		,				1    ):
				if number % i == 0:
						values.append(UpperCamelCase    )
						if int(number // i    ) != i:
								values.append(int(number // i    )    )
		return sorted(UpperCamelCase    )






def 						_SCREAMING_SNAKE_CASE							( UpperCamelCase     :	int    ):
		return sum(factors(UpperCamelCase    )    ) > n






def 						_SCREAMING_SNAKE_CASE							( UpperCamelCase     :	int    ):
		A__											=							factors(UpperCamelCase    )
		A__											=							len(UpperCamelCase    )
		A__											=							[[0 for i in range(number + 1    )] for j in range(r + 1    )]
		for i in range(r + 1    ):
				A__											=							True

		for i in range(1		,				number + 1    ):
				A__											=							False

		for i in range(1		,				r + 1    ):
				for j in range(1		,				number + 1    ):
						if j < values[i - 1]:
								A__											=							subset[i - 1][j]
						else:
								A__											=							subset[i - 1][j] or subset[i - 1][j - values[i - 1]]

		return subset[r][number] != 0






def 						_SCREAMING_SNAKE_CASE							( UpperCamelCase     :	int    ):
		return abundant(UpperCamelCase    ) and not semi_perfect(UpperCamelCase    )


if __name__ == "__main__":
						import doctest

						doctest.testmod(verbose=True)
						for number in (69, 70, 71):
												print(F'{number} is {"" if weird(number) else "not "}weird.')












"""simple docstring"""




def 						_SCREAMING_SNAKE_CASE							( UpperCamelCase     :	Dict    ):
  A__											=							len(UpperCamelCase    )
  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)
        A__											=							lst[j + 1]
        A__											=							lst[j]
        A__											=							temp
      if (
          lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
      ):  # applying bubble sort algorithm from right to left (or backwards)
        A__											=							lst[no_of_elements - 1 - j]
        A__											=							lst[no_of_elements - 2 - j]
        A__											=							temp
  return lst


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




