




'''simple docstring'''




import math




def     snake_case__     (			lowerCamelCase__					: int      ) -> bool:

					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(lowerCamelCase__      ) + 1      )      ,		6      ):
										if number % i == 0 or number % (i + 2) == 0:
															return False
					return True




def     snake_case__     (			lowerCamelCase__					: int = 2_0_0_0_0_0_0      ) -> int:
					return sum(num for num in range(3      ,		lowerCamelCase__      ,		2      ) if is_prime(lowerCamelCase__      )      ) + 2 if n > 2 else 0


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









'''simple docstring'''




import os




def     snake_case__     (			) -> int:
					A_			:  List[str]			=				os.path.dirname(os.path.realpath(lowerCamelCase__      )      )
					A_			:  str			=				os.path.join(lowerCamelCase__      ,		'''triangle.txt'''      )

					with open(lowerCamelCase__      ) as in_file:
										A_			:  List[str]			=				[[int(lowerCamelCase__      ) for i in line.split()] for line in in_file]

					while len(lowerCamelCase__      ) != 1:
										A_			:  List[str]			=				triangle.pop()
										A_			:  Optional[Any]			=				triangle[-1]
										for j in range(len(lowerCamelCase__      ) - 1      ):
															curr_row[j] += max(last_row[j]      ,		last_row[j + 1]      )
					return triangle[0][0]


if __name__ == "__main__":
							print(solution())



