


import os






def 				UpperCamelCase      (			)     ->						Optional[int]:
		"""simple docstring"""




		lowercase__      =	os.path.dirname(os.path.realpath(__magic_name__  )  )
		lowercase__      =	os.path.join(__magic_name__					,					"""triangle.txt"""  )

		with open(__magic_name__  ) as f:
				lowercase__      =	f.readlines()

		lowercase__      =	[[int(__magic_name__  ) for y in x.rstrip("""\r\n"""  ).split(""" """  )] for x in triangle]

		for i in range(1					,					len(__magic_name__  )  ):
				for j in range(len(a[i]  )  ):
						lowercase__      =	a[i - 1][j] if j != len(a[i - 1]  ) else 0
						lowercase__      =	a[i - 1][j - 1] if j > 0 else 0
						a[i][j] += max(__magic_name__					,					__magic_name__  )
		return max(a[-1]  )


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





import math






def 				UpperCamelCase      (			__magic_name__  :							int  )     ->						bool:
		"""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(__magic_name__  ) + 1  )					,					6  ):
				if number % i == 0 or number % (i + 2) == 0:
						return False
		return True






def 				UpperCamelCase      (			__magic_name__  :							int = 1000					,					__magic_name__  :							int = 1000  )     ->						int:
		"""simple docstring"""




		lowercase__      =	[0, 0, 0]  # length, a, b
		for a in range((a_limit * -1) + 1					,					__magic_name__  ):
				for b in range(2					,					__magic_name__  ):
						if is_prime(__magic_name__  ):
								lowercase__      =	0
								lowercase__      =	0
								while is_prime((n**2) + (a * n) + b  ):
										count += 1
										n += 1
								if count > longest[0]:
										lowercase__      =	[count, a, b]
		lowercase__      =	longest[1] * longest[2]
		return ans


if __name__ == "__main__":
	print(solution(1_0_0_0, 1_0_0_0))

