



def 	_UpperCAmelCase       (   snake_case = 10_00    ):





					"""simple docstring"""

					_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() = }")








from __future__ import annotations


def 	_UpperCAmelCase       (   snake_case    ):





					"""simple docstring"""

					_lowerCAmelCase      			=					sorted(snake_case    )
					_lowerCAmelCase      			=					len(snake_case    )
					_lowerCAmelCase      			=					length >> 1
					return (
					    (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
					    if length % 2 == 0
					    else sorted_list[mid_index]
					)


def 	_UpperCAmelCase       (   ):





					"""simple docstring"""

					import doctest

					doctest.testmod()


if __name__ == "__main__":
	main()



