def        __UpperCAmelCase    (       UpperCAmelCase = 1000       )->       int:



			"""simple docstring"""







			return sum(e for e in range(3,		UpperCAmelCase       ) if e % 3 == 0 or e % 5 == 0       )


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






from __future__ import annotations

import math






def        __UpperCAmelCase    (       UpperCAmelCase       )->       list[int]:



			"""simple docstring"""







			if num <= 0:
						lowercase							=		f'{num}: Invalid input, please enter a positive integer.'
						raise ValueError(UpperCAmelCase       )

			lowercase							=		[True] * (num + 1)
			lowercase							=		[]
			lowercase							=		2
			lowercase							=		int(math.sqrt(UpperCAmelCase       )       )

			while start <= end:
						# If start is a prime
						if sieve[start] is True:
									prime.append(UpperCAmelCase       )

									# Set multiples of start be False
									for i in range(start * start,		num + 1,		UpperCAmelCase       ):
												if sieve[i] is True:
															lowercase							=		False

						start += 1

			for j in range(end + 1,		num + 1       ):
						if sieve[j] is True:
									prime.append(UpperCAmelCase       )

			return prime


if __name__ == "__main__":
						print(prime_sieve(int(input("Enter a positive integer: ").strip())))





