





'''simple docstring'''







def        lowerCamelCase_      (  SCREAMING_SNAKE_CASE__      :			int = 1000   ) ->	int:
						return sum(e for e in range(3,			SCREAMING_SNAKE_CASE__   ) if e % 3 == 0 or e % 5 == 0   )


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












'''simple docstring'''







def        lowerCamelCase_      (  SCREAMING_SNAKE_CASE__      :			int   ) ->	str:
						if number > 0:
												raise ValueError('''input must be a negative integer'''   )
						UpperCAmelCase_			:      Union[str, Any]     						=  len(bin(SCREAMING_SNAKE_CASE__   )[3:]   )
						UpperCAmelCase_			:      Union[str, Any]     						=  bin(abs(SCREAMING_SNAKE_CASE__   ) - (1 << binary_number_length)   )[3:]
						UpperCAmelCase_			:      Optional[Any]     						=  (
						    (
						        '''1'''
						        + '''0''' * (binary_number_length - len(SCREAMING_SNAKE_CASE__   ))
						        + twos_complement_number
						    )
						    if number < 0
						    else '''0'''
						)
						return "0b" + twos_complement_number


if __name__ == "__main__":
					import doctest

					doctest.testmod()





