


'''simple docstring'''


import math







def       snake_case_       (  SCREAMING_SNAKE_CASE__					):







				"""simple docstring"""





				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5							,				int(math.sqrt(SCREAMING_SNAKE_CASE__					) + 1					)							,				6					):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True







def       snake_case_       (  SCREAMING_SNAKE_CASE__ = 200_0000					):







				"""simple docstring"""





				return sum(num for num in range(3							,				SCREAMING_SNAKE_CASE__							,				2					) if is_prime(SCREAMING_SNAKE_CASE__					)					) + 2 if n > 2 else 0


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








'''simple docstring'''


import sys







def       snake_case_       (  SCREAMING_SNAKE_CASE__							,				SCREAMING_SNAKE_CASE__					):







				"""simple docstring"""





				if not numbers:
								return 0
				if target == 0 and target in numbers:
								return 0
				if not isinstance(SCREAMING_SNAKE_CASE__							,				(list, tuple)					) or not all(
				    isinstance(SCREAMING_SNAKE_CASE__							,				SCREAMING_SNAKE_CASE__					) for number in numbers					):
								raise ValueError("""numbers must be an iterable of integers"""					)

				_SCREAMING_SNAKE_CASE			:	str							=				0
				_SCREAMING_SNAKE_CASE			:	int							=				sys.maxsize

				while right < len(SCREAMING_SNAKE_CASE__					):
								curr_sum += numbers[right]
								while curr_sum >= target and left <= right:
												_SCREAMING_SNAKE_CASE			:	Any							=				min(SCREAMING_SNAKE_CASE__							,				right - left + 1					)
												curr_sum -= numbers[left]
												left += 1
								right += 1

				return 0 if min_len == sys.maxsize else min_len




