


'''simple docstring'''

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






       """simple docstring"""







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


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








'''simple docstring'''

def _SCREAMING_SNAKE_CASE				(A	)	->	list:






       """simple docstring"""







       lowercase__				      =			len(A	)

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

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

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

       return collection


if __name__ == "__main__":
 import doctest

 doctest.testmod()




