






"""simple docstring"""





def 					lowerCamelCase__	(							_lowerCamelCase	:		list			)				->    list:
  lowerCamelCase_   					=						len(_lowerCamelCase			)

  # Set the gap value to be decreased by a factor of 1.3
  # after each iteration
  lowerCamelCase_   					=						1.3

  # Continue sorting until the gap is 1
  while gap > 1:
    # Decrease the gap value
    lowerCamelCase_   					=						int(gap / shrink			)

    # Sort the elements using insertion sort
    for i in range(_lowerCamelCase		,    len(_lowerCamelCase			)			):
      lowerCamelCase_   					=						collection[i]
      lowerCamelCase_   					=						i
      while j >= gap and collection[j - gap] > temp:
        lowerCamelCase_   					=						collection[j - gap]
        j -= gap
      lowerCamelCase_   					=						temp

  return collection


if __name__ == "__main__":
  import doctest

  doctest.testmod()












"""simple docstring"""





def 					lowerCamelCase__	(							_lowerCamelCase	:		int = 1000			)				->    int:
  lowerCamelCase_   					=						0
  lowerCamelCase_   					=						(n - 1) // 3
  total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
  lowerCamelCase_   					=						(n - 1) // 5
  total += ((terms) * (10 + (terms - 1) * 5)) // 2
  lowerCamelCase_   					=						(n - 1) // 15
  total -= ((terms) * (30 + (terms - 1) * 15)) // 2
  return total


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




