



def 				A      (	_UpperCAmelCase							:  int = 1_000       )							->					int:







			'''simple docstring'''
			_UpperCAmelCase									=  0
			_UpperCAmelCase									=  (n - 1) // 3
			total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
			_UpperCAmelCase									=  (n - 1) // 5
			total += ((terms) * (10 + (terms - 1) * 5)) // 2
			_UpperCAmelCase									=  (n - 1) // 15
			total -= ((terms) * (30 + (terms - 1) * 15)) // 2
			return total


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





def 				A      (	_UpperCAmelCase							:  List[Any]       )							->					List[Any]:







			'''simple docstring'''
			_UpperCAmelCase									=  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)
												_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")
							UpperCAmelCase__  =			[int(x) for x in input().split()]  # inputing elements of the list in one line
							UpperCAmelCase__  =			double_sort(lst)
							print("the sorted list is")
							print(sorted_lst)
