






def 					snake_case_						(   lowerCAmelCase_				:  int = 1000					):
							__lowercase					:							Tuple			=   3
							__lowercase					:							Any			=   0
							while a < n:
														if a % 3 == 0 or a % 5 == 0:
																					result += a
														elif a % 15 == 0:
																					result -= a
														a += 1
							return result


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







from __future__ import annotations
def 					snake_case_						(   lowerCAmelCase_				:  int				,				lowerCAmelCase_				:  int					):
							if partitions <= 0:
														raise ValueError("""partitions must be a positive number!"""					)
							if partitions > number_of_bytes:
														raise ValueError("""partitions can not > number_of_bytes!"""					)
							__lowercase					:							Dict			=   number_of_bytes // partitions
							__lowercase					:							Union[str, Any]			=   []
							for i in range(lowerCAmelCase_					):
														__lowercase					:							str			=   i * bytes_per_partition + 1
														__lowercase					:							List[Any]			=   (
														    number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
														)
														allocation_list.append(F"{start_bytes}-{end_bytes}"					)
							return allocation_list


if __name__ == "__main__":
	import doctest

	doctest.testmod()