def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:Dict = 1000  )				-> List[Any]:
						a_							:			Dict     		=					0
						a_							:			Tuple     		=					(n - 1) // 3
						total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
						a_							:			Optional[Any]     		=					(n - 1) // 5
						total += ((terms) * (10 + (terms - 1) * 5)) // 2
						a_							:			Any     		=					(n - 1) // 15
						total -= ((terms) * (30 + (terms - 1) * 15)) // 2
						return total


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





"""simple docstring"""






def  lowerCAmelCase_      (_SCREAMING_SNAKE_CASE	:str  )				-> int:
						a_							:			Optional[int]     		=					0
						for letter in data:
												a_							:			Union[str, Any]     		=					(hash_ << 4) + ord(_SCREAMING_SNAKE_CASE  )
												a_							:			Optional[int]     		=					hash_ & 0xf000_0000
												if x != 0:
																		hash_ ^= x >> 24
												hash_ &= ~x
						return hash_


if __name__ == "__main__":
				import doctest

				doctest.testmod()




